./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.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_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/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_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/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_4595a5ed-f208-470f-917e-db7613c0ea49/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 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:59:18,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:59:18,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:59:18,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:59:18,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:59:18,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:59:18,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:59:18,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:59:18,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:59:18,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:59:18,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:59:18,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:59:18,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:59:18,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:59:18,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:59:18,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:59:18,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:59:18,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:59:18,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:59:18,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:59:18,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:59:18,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:59:18,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:59:18,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:59:18,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:59:18,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:59:18,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:59:18,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:59:18,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:59:18,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:59:18,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:59:18,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:59:18,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:59:18,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:59:18,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:59:18,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:59:18,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:59:18,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:59:18,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:59:18,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:59:18,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:59:18,380 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 14:59:18,424 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:59:18,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:59:18,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:59:18,426 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:59:18,426 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:59:18,426 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:59:18,426 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:59:18,427 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 14:59:18,433 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:59:18,433 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:59:18,434 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 14:59:18,434 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 14:59:18,435 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:59:18,435 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 14:59:18,435 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 14:59:18,435 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 14:59:18,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:59:18,436 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:59:18,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 14:59:18,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:59:18,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:59:18,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:59:18,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:59:18,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:59:18,438 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:59:18,438 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:59:18,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:59:18,438 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:59:18,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:59:18,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:59:18,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:59:18,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:59:18,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:59:18,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:59:18,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:59:18,442 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 14:59:18,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 14:59:18,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:59:18,443 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:59:18,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:59:18,444 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_4595a5ed-f208-470f-917e-db7613c0ea49/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_4595a5ed-f208-470f-917e-db7613c0ea49/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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2021-11-19 14:59:18,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:59:18,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:59:18,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:59:18,713 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:59:18,717 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:59:18,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-19 14:59:18,790 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/data/447c16351/4c6abf6da0084086afa43e71d6df08b4/FLAGc0dfcc345 [2021-11-19 14:59:19,278 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:59:19,278 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-19 14:59:19,286 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/data/447c16351/4c6abf6da0084086afa43e71d6df08b4/FLAGc0dfcc345 [2021-11-19 14:59:19,637 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/data/447c16351/4c6abf6da0084086afa43e71d6df08b4 [2021-11-19 14:59:19,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:59:19,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:59:19,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:59:19,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:59:19,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:59:19,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:59:19" (1/1) ... [2021-11-19 14:59:19,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e74a729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19, skipping insertion in model container [2021-11-19 14:59:19,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:59:19" (1/1) ... [2021-11-19 14:59:19,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:59:19,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:59:19,848 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_4595a5ed-f208-470f-917e-db7613c0ea49/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-19 14:59:19,854 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:59:19,861 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:59:19,880 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_4595a5ed-f208-470f-917e-db7613c0ea49/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-19 14:59:19,882 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:59:19,894 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:59:19,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19 WrapperNode [2021-11-19 14:59:19,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:59:19,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:59:19,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:59:19,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:59:19,903 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:59:19" (1/1) ... [2021-11-19 14:59:19,911 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:59:19" (1/1) ... [2021-11-19 14:59:19,932 INFO L137 Inliner]: procedures = 18, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2021-11-19 14:59:19,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:59:19,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:59:19,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:59:19,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:59:19,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19" (1/1) ... [2021-11-19 14:59:19,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19" (1/1) ... [2021-11-19 14:59:19,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19" (1/1) ... [2021-11-19 14:59:19,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19" (1/1) ... [2021-11-19 14:59:19,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19" (1/1) ... [2021-11-19 14:59:19,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19" (1/1) ... [2021-11-19 14:59:19,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19" (1/1) ... [2021-11-19 14:59:19,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:59:19,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:59:19,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:59:19,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:59:19,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19" (1/1) ... [2021-11-19 14:59:19,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:59:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:59:20,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:59:20,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:59:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:59:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 14:59:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 14:59:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-19 14:59:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:59:20,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:59:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-19 14:59:20,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 14:59:20,156 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:59:20,157 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:59:20,336 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:59:20,350 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:59:20,350 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 14:59:20,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:59:20 BoogieIcfgContainer [2021-11-19 14:59:20,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:59:20,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:59:20,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:59:20,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:59:20,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:59:19" (1/3) ... [2021-11-19 14:59:20,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79134d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:59:20, skipping insertion in model container [2021-11-19 14:59:20,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:19" (2/3) ... [2021-11-19 14:59:20,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79134d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:59:20, skipping insertion in model container [2021-11-19 14:59:20,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:59:20" (3/3) ... [2021-11-19 14:59:20,362 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2021-11-19 14:59:20,367 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:59:20,367 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:59:20,416 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:59:20,423 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:59:20,423 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:59:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-19 14:59:20,443 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:59:20,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:59:20,445 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:59:20,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:59:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1338621212, now seen corresponding path program 1 times [2021-11-19 14:59:20,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:59:20,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70259023] [2021-11-19 14:59:20,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:59:20,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:59:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:59:20,704 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:59:20,704 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:59:20,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70259023] [2021-11-19 14:59:20,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70259023] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:59:20,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:59:20,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 14:59:20,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528105516] [2021-11-19 14:59:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:59:20,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 14:59:20,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:59:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 14:59:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 14:59:20,738 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:59:20,857 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2021-11-19 14:59:20,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 14:59:20,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-19 14:59:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:59:20,872 INFO L225 Difference]: With dead ends: 44 [2021-11-19 14:59:20,873 INFO L226 Difference]: Without dead ends: 26 [2021-11-19 14:59:20,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-19 14:59:20,884 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:59:20,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:59:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-19 14:59:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2021-11-19 14:59:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-11-19 14:59:20,924 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11 [2021-11-19 14:59:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:59:20,925 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-11-19 14:59:20,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-11-19 14:59:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-19 14:59:20,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:59:20,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:59:20,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 14:59:20,927 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:59:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:59:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1321610551, now seen corresponding path program 1 times [2021-11-19 14:59:20,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:59:20,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012040245] [2021-11-19 14:59:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:59:20,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:59:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:59:21,023 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:59:21,024 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:59:21,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012040245] [2021-11-19 14:59:21,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012040245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:59:21,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:59:21,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 14:59:21,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323931167] [2021-11-19 14:59:21,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:59:21,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 14:59:21,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:59:21,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 14:59:21,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 14:59:21,033 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:59:21,062 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-11-19 14:59:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 14:59:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-19 14:59:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:59:21,064 INFO L225 Difference]: With dead ends: 33 [2021-11-19 14:59:21,065 INFO L226 Difference]: Without dead ends: 25 [2021-11-19 14:59:21,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 14:59:21,068 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 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:59:21,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:59:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-19 14:59:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2021-11-19 14:59:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2021-11-19 14:59:21,081 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2021-11-19 14:59:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:59:21,083 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-11-19 14:59:21,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2021-11-19 14:59:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-19 14:59:21,085 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:59:21,091 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:59:21,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 14:59:21,092 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:59:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:59:21,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1139004290, now seen corresponding path program 1 times [2021-11-19 14:59:21,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:59:21,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765811464] [2021-11-19 14:59:21,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:59:21,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:59:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:59:21,122 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 14:59:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:59:21,156 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-19 14:59:21,157 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 14:59:21,158 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 14:59:21,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 14:59:21,164 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-19 14:59:21,167 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 14:59:21,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 02:59:21 BoogieIcfgContainer [2021-11-19 14:59:21,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 14:59:21,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 14:59:21,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 14:59:21,201 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 14:59:21,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:59:20" (3/4) ... [2021-11-19 14:59:21,205 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-19 14:59:21,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 14:59:21,206 INFO L158 Benchmark]: Toolchain (without parser) took 1564.79ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 68.2MB in the beginning and 89.1MB in the end (delta: -20.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2021-11-19 14:59:21,206 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 96.5MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:59:21,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.04ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 67.9MB in the beginning and 100.3MB in the end (delta: -32.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 14:59:21,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.98ms. Allocated memory is still 125.8MB. Free memory was 100.3MB in the beginning and 98.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:59:21,208 INFO L158 Benchmark]: Boogie Preprocessor took 30.01ms. Allocated memory is still 125.8MB. Free memory was 98.7MB in the beginning and 97.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:59:21,209 INFO L158 Benchmark]: RCFGBuilder took 388.78ms. Allocated memory is still 125.8MB. Free memory was 97.3MB in the beginning and 86.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-19 14:59:21,210 INFO L158 Benchmark]: TraceAbstraction took 845.61ms. Allocated memory is still 125.8MB. Free memory was 86.4MB in the beginning and 89.9MB in the end (delta: -3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:59:21,210 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 125.8MB. Free memory was 89.7MB in the beginning and 89.1MB in the end (delta: 615.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:59:21,227 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 96.5MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.04ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 67.9MB in the beginning and 100.3MB in the end (delta: -32.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.98ms. Allocated memory is still 125.8MB. Free memory was 100.3MB in the beginning and 98.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.01ms. Allocated memory is still 125.8MB. Free memory was 98.7MB in the beginning and 97.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.78ms. Allocated memory is still 125.8MB. Free memory was 97.3MB in the beginning and 86.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 845.61ms. Allocated memory is still 125.8MB. Free memory was 86.4MB in the beginning and 89.9MB in the end (delta: -3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 125.8MB. Free memory was 89.7MB in the beginning and 89.1MB in the end (delta: 615.5kB). Peak memory consumption was 2.1MB. 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: 51]: 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 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] main__t = __VERIFIER_nondet_float() [L20] int main____CPAchecker_TMP_0; [L21] EXPR main__min[0] VAL [__return_main=0, main__max={4:0}, main__min={5:0}, main__min[0]=50] [L21] COND TRUE main__t >= (main__min[0]) [L23] EXPR main__max[4UL] VAL [__return_main=0, main__max={4:0}, main__max[4UL]=51, main__min={5:0}] [L23] COND TRUE main__t <= (main__max[4UL]) [L25] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__max={4:0}, main__min={5:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__max[main__i]=49, main__min={5:0}] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L63] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L51] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 34 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 30 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-19 14:59:21,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/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_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/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_4595a5ed-f208-470f-917e-db7613c0ea49/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 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:59:23,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:59:23,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:59:23,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:59:23,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:59:23,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:59:23,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:59:23,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:59:23,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:59:23,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:59:23,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:59:23,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:59:23,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:59:23,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:59:23,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:59:23,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:59:23,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:59:23,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:59:23,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:59:23,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:59:23,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:59:23,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:59:23,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:59:23,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:59:23,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:59:23,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:59:23,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:59:23,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:59:23,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:59:23,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:59:23,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:59:23,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:59:23,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:59:23,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:59:23,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:59:23,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:59:23,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:59:23,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:59:23,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:59:23,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:59:23,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:59:23,953 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 14:59:23,996 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:59:23,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:59:23,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:59:23,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:59:23,998 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:59:23,998 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:59:23,998 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:59:23,998 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:59:23,999 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:59:23,999 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:59:24,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:59:24,001 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:59:24,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:59:24,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:59:24,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:59:24,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:59:24,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:59:24,002 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:59:24,003 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 14:59:24,003 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 14:59:24,003 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:59:24,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:59:24,003 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:59:24,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:59:24,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:59:24,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 14:59:24,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:59:24,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:59:24,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:59:24,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:59:24,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:59:24,005 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 14:59:24,006 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 14:59:24,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:59:24,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:59:24,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:59:24,007 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_4595a5ed-f208-470f-917e-db7613c0ea49/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_4595a5ed-f208-470f-917e-db7613c0ea49/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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2021-11-19 14:59:24,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:59:24,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:59:24,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:59:24,460 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:59:24,460 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:59:24,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-19 14:59:24,521 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/data/4bec10347/189e06b836fd4f2b8be30e11da3d2090/FLAG45a3d8712 [2021-11-19 14:59:25,028 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:59:25,029 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-19 14:59:25,040 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/data/4bec10347/189e06b836fd4f2b8be30e11da3d2090/FLAG45a3d8712 [2021-11-19 14:59:25,363 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/data/4bec10347/189e06b836fd4f2b8be30e11da3d2090 [2021-11-19 14:59:25,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:59:25,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:59:25,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:59:25,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:59:25,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:59:25,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:59:25" (1/1) ... [2021-11-19 14:59:25,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7885d538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25, skipping insertion in model container [2021-11-19 14:59:25,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:59:25" (1/1) ... [2021-11-19 14:59:25,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:59:25,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:59:25,557 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_4595a5ed-f208-470f-917e-db7613c0ea49/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-19 14:59:25,573 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:59:25,585 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:59:25,685 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_4595a5ed-f208-470f-917e-db7613c0ea49/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-19 14:59:25,688 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:59:25,709 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:59:25,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25 WrapperNode [2021-11-19 14:59:25,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:59:25,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:59:25,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:59:25,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:59:25,719 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:59:25" (1/1) ... [2021-11-19 14:59:25,740 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:59:25" (1/1) ... [2021-11-19 14:59:25,774 INFO L137 Inliner]: procedures = 19, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 100 [2021-11-19 14:59:25,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:59:25,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:59:25,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:59:25,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:59:25,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25" (1/1) ... [2021-11-19 14:59:25,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25" (1/1) ... [2021-11-19 14:59:25,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25" (1/1) ... [2021-11-19 14:59:25,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25" (1/1) ... [2021-11-19 14:59:25,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25" (1/1) ... [2021-11-19 14:59:25,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25" (1/1) ... [2021-11-19 14:59:25,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25" (1/1) ... [2021-11-19 14:59:25,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:59:25,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:59:25,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:59:25,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:59:25,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25" (1/1) ... [2021-11-19 14:59:25,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:59:25,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:59:25,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:59:25,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:59:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:59:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-19 14:59:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 14:59:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 14:59:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-19 14:59:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:59:25,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:59:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 14:59:26,024 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:59:26,026 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:59:27,393 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:59:27,399 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:59:27,399 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 14:59:27,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:59:27 BoogieIcfgContainer [2021-11-19 14:59:27,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:59:27,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:59:27,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:59:27,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:59:27,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:59:25" (1/3) ... [2021-11-19 14:59:27,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e43dd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:59:27, skipping insertion in model container [2021-11-19 14:59:27,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:59:25" (2/3) ... [2021-11-19 14:59:27,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e43dd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:59:27, skipping insertion in model container [2021-11-19 14:59:27,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:59:27" (3/3) ... [2021-11-19 14:59:27,409 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2021-11-19 14:59:27,414 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:59:27,414 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:59:27,462 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:59:27,469 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:59:27,469 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:59:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-19 14:59:27,488 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:59:27,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:59:27,490 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:59:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:59:27,495 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2021-11-19 14:59:27,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:59:27,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684176654] [2021-11-19 14:59:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:59:27,509 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:59:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:59:27,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:59:27,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 14:59:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:59:27,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-19 14:59:27,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:59:27,947 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:59:27,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:59:28,032 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:59:28,033 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:59:28,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684176654] [2021-11-19 14:59:28,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684176654] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:59:28,034 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:59:28,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-19 14:59:28,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210833301] [2021-11-19 14:59:28,037 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:59:28,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 14:59:28,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:59:28,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 14:59:28,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-19 14:59:28,082 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:30,255 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:59:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:59:30,308 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2021-11-19 14:59:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 14:59:30,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-19 14:59:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:59:30,319 INFO L225 Difference]: With dead ends: 35 [2021-11-19 14:59:30,320 INFO L226 Difference]: Without dead ends: 21 [2021-11-19 14:59:30,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-19 14:59:30,326 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 59 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:59:30,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 59 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-11-19 14:59:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-19 14:59:30,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-11-19 14:59:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-11-19 14:59:30,360 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 12 [2021-11-19 14:59:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:59:30,360 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-11-19 14:59:30,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2021-11-19 14:59:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 14:59:30,361 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:59:30,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:59:30,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-19 14:59:30,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:59:30,565 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:59:30,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:59:30,566 INFO L85 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2021-11-19 14:59:30,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:59:30,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131211257] [2021-11-19 14:59:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:59:30,568 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:59:30,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:59:30,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:59:30,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 14:59:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:59:30,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 14:59:30,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:59:31,009 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:59:31,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:59:31,084 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:59:31,085 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:59:31,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131211257] [2021-11-19 14:59:31,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131211257] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:59:31,086 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:59:31,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-19 14:59:31,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424842447] [2021-11-19 14:59:31,087 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:59:31,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 14:59:31,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:59:31,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 14:59:31,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 14:59:31,090 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:33,262 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:59:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:59:34,201 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-11-19 14:59:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 14:59:34,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-19 14:59:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:59:34,204 INFO L225 Difference]: With dead ends: 23 [2021-11-19 14:59:34,204 INFO L226 Difference]: Without dead ends: 19 [2021-11-19 14:59:34,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-19 14:59:34,206 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:59:34,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2021-11-19 14:59:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-19 14:59:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-19 14:59:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-19 14:59:34,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2021-11-19 14:59:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:59:34,212 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-19 14:59:34,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:59:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-19 14:59:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 14:59:34,216 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:59:34,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:59:34,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-19 14:59:34,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:59:34,435 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:59:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:59:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2021-11-19 14:59:34,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:59:34,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899454974] [2021-11-19 14:59:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:59:34,437 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:59:34,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:59:34,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:59:34,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 14:59:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:59:34,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-19 14:59:34,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:59:36,901 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 14:59:36,903 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 178 treesize of output 86 [2021-11-19 15:00:28,114 WARN L227 SmtUtils]: Spent 14.07s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 15:01:21,192 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2021-11-19 15:01:23,218 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2021-11-19 15:04:05,352 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2021-11-19 15:04:07,379 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2021-11-19 15:04:07,380 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 15:04:07,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:04:16,865 WARN L838 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#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_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from false [2021-11-19 15:04:18,916 WARN L860 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#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_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from true [2021-11-19 15:04:29,291 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#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_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53))) is different from false [2021-11-19 15:04:31,345 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#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_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53))) is different from true [2021-11-19 15:04:41,693 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from false [2021-11-19 15:04:43,751 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from true [2021-11-19 15:04:53,213 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53)))) is different from false [2021-11-19 15:04:55,266 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53)))) is different from true [2021-11-19 15:05:07,769 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53)))) is different from false [2021-11-19 15:05:09,823 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53)))) is different from true [2021-11-19 15:05:26,941 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ +zero 11 53)))))) is different from false [2021-11-19 15:05:28,996 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ +zero 11 53)))))) is different from true [2021-11-19 15:05:43,172 WARN L227 SmtUtils]: Spent 14.14s 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 15:05:43,173 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-19 15:05:43,173 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 207 treesize of output 102 [2021-11-19 15:06:51,859 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)))))) is different from false [2021-11-19 15:06:53,918 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)))))) is different from true [2021-11-19 15:06:53,918 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 15:06:53,919 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 15:06:53,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899454974] [2021-11-19 15:06:53,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899454974] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 15:06:53,920 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:06:53,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 19 [2021-11-19 15:06:53,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387108311] [2021-11-19 15:06:53,921 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 15:06:53,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 15:06:53,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 15:06:53,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 15:06:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=72, Unknown=25, NotChecked=234, Total=380 [2021-11-19 15:06:53,924 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:06:56,159 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 15:06:58,216 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 15:07:00,251 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ +zero 11 53)))))) (= (let ((.cse6 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#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))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse8) (= |c_ULTIMATE.start_main_#t~mem5#1| .cse8) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-19 15:07:02,310 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ +zero 11 53)))))) (= (let ((.cse6 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#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))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse8) (= |c_ULTIMATE.start_main_#t~mem5#1| .cse8) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 15:07:04,351 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse6 (select .cse5 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (= |c_ULTIMATE.start_main_#t~mem6#1| .cse0) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))) (_ +zero 11 53))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)))) is different from false [2021-11-19 15:07:06,406 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse6 (select .cse5 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (= |c_ULTIMATE.start_main_#t~mem6#1| .cse0) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))) (_ +zero 11 53))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)))) is different from true [2021-11-19 15:07:08,446 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse6 (select .cse5 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))) (_ +zero 11 53))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)))) is different from false [2021-11-19 15:07:10,502 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse6 (select .cse5 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))) (_ +zero 11 53))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)))) is different from true [2021-11-19 15:07:14,596 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse11 (select .cse8 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse1 (let ((.cse10 (select .cse5 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (let ((.cse6 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse7 (select .cse8 (bvadd .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select .cse5 (bvadd .cse6 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (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_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ +zero 11 53))))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)))) is different from true [2021-11-19 15:07:18,299 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse6 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse11 (select .cse8 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse3 (let ((.cse10 (select .cse8 (bvadd .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse1 (let ((.cse9 (select .cse5 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse4 (select .cse5 (bvadd .cse6 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (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_~main__t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (_ +zero 11 53))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_#t~mem7#1| .cse3) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)))) is different from true [2021-11-19 15:07:21,597 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse8 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse10 (select .cse2 (bvadd .cse8 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse3 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (and (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (= (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (let ((.cse6 (select .cse7 (bvadd .cse8 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (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_~main__t~0#1| .cse5) (fp.sub c_currentRoundingMode .cse0 .cse5)))) (_ +zero 11 53)) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from true [2021-11-19 15:07:50,383 WARN L227 SmtUtils]: Spent 14.57s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 15:07:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:07:50,827 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2021-11-19 15:07:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-19 15:07:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-19 15:07:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:07:50,834 INFO L225 Difference]: With dead ends: 29 [2021-11-19 15:07:50,834 INFO L226 Difference]: Without dead ends: 24 [2021-11-19 15:07:50,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 131.5s TimeCoverageRelationStatistics Valid=68, Invalid=86, Unknown=42, NotChecked=560, Total=756 [2021-11-19 15:07:50,838 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 15:07:50,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 94 Unchecked, 0.6s Time] [2021-11-19 15:07:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-19 15:07:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-11-19 15:07:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:07:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2021-11-19 15:07:50,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2021-11-19 15:07:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:07:50,846 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2021-11-19 15:07:50,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:07:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2021-11-19 15:07:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 15:07:50,848 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:07:50,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:07:50,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-19 15:07:51,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 15:07:51,055 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:07:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:07:51,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2021-11-19 15:07:51,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 15:07:51,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233307511] [2021-11-19 15:07:51,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:07:51,057 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 15:07:51,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 15:07:51,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 15:07:51,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-19 15:07:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:07:51,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-19 15:07:51,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:07:51,471 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 15:07:51,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:07:51,573 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 15:07:51,574 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 15:07:51,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233307511] [2021-11-19 15:07:51,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233307511] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 15:07:51,574 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:07:51,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-19 15:07:51,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825614700] [2021-11-19 15:07:51,575 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 15:07:51,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 15:07:51,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 15:07:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 15:07:51,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 15:07:51,577 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:07:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:07:51,624 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-11-19 15:07:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 15:07:51,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-19 15:07:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:07:51,625 INFO L225 Difference]: With dead ends: 35 [2021-11-19 15:07:51,626 INFO L226 Difference]: Without dead ends: 20 [2021-11-19 15:07:51,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 15:07:51,627 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:07:51,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:07:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-19 15:07:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-19 15:07:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:07:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-19 15:07:51,635 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-19 15:07:51,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:07:51,635 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-19 15:07:51,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:07:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-19 15:07:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-19 15:07:51,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:07:51,637 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:07:51,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-19 15:07:51,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 15:07:51,859 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:07:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:07:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2021-11-19 15:07:51,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 15:07:51,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907589768] [2021-11-19 15:07:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:07:51,861 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 15:07:51,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 15:07:51,862 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 15:07:51,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4595a5ed-f208-470f-917e-db7613c0ea49/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-19 15:07:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:07:53,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-19 15:07:53,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:07:56,749 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 15:07:56,749 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 178 treesize of output 86 [2021-11-19 15:08:23,465 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 15:09:05,549 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 15:10:27,251 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2))))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (fp.geq .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from false [2021-11-19 15:10:29,282 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2))))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (fp.geq .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from true [2021-11-19 15:11:46,357 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2))))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (fp.geq .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from false [2021-11-19 15:11:48,388 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2))))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (fp.geq .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from true