./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 aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/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_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V --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-aef121e [2021-11-23 02:02:52,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:02:52,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:02:52,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:02:52,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:02:52,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:02:52,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:02:52,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:02:52,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:02:52,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:02:52,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:02:52,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:02:52,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:02:52,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:02:52,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:02:52,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:02:52,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:02:52,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:02:52,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:02:52,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:02:52,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:02:52,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:02:52,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:02:52,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:02:52,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:02:52,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:02:52,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:02:52,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:02:52,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:02:52,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:02:52,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:02:52,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:02:52,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:02:52,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:02:52,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:02:52,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:02:52,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:02:52,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:02:52,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:02:52,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:02:52,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:02:52,865 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 02:02:52,891 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:02:52,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:02:52,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:02:52,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:02:52,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:02:52,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:02:52,894 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:02:52,894 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:02:52,894 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:02:52,895 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:02:52,895 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:02:52,895 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:02:52,895 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:02:52,895 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:02:52,896 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:02:52,896 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:02:52,896 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:02:52,896 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:02:52,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:02:52,897 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:02:52,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:02:52,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:02:52,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:02:52,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 02:02:52,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:02:52,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 02:02:52,899 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:02:52,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 02:02:52,900 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:02:52,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 02:02:52,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:02:52,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:02:52,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:02:52,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:02:52,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:02:52,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 02:02:52,902 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:02:52,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:02:52,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 02:02:52,902 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:02:52,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:02:52,903 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_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/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_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V 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-23 02:02:53,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:02:53,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:02:53,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:02:53,191 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:02:53,192 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:02:53,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-23 02:02:53,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/data/8a1321370/36b54dd3ada749f891e46e9ae0bfe256/FLAG200e1509a [2021-11-23 02:02:53,777 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:02:53,777 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-23 02:02:53,784 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/data/8a1321370/36b54dd3ada749f891e46e9ae0bfe256/FLAG200e1509a [2021-11-23 02:02:54,145 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/data/8a1321370/36b54dd3ada749f891e46e9ae0bfe256 [2021-11-23 02:02:54,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:02:54,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:02:54,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:02:54,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:02:54,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:02:54,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@385cdd3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54, skipping insertion in model container [2021-11-23 02:02:54,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:02:54,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:02:54,373 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_7bfab07b-6198-4081-89d0-c256221713e7/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-23 02:02:54,378 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:02:54,386 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:02:54,408 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_7bfab07b-6198-4081-89d0-c256221713e7/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-23 02:02:54,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:02:54,424 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:02:54,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54 WrapperNode [2021-11-23 02:02:54,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:02:54,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:02:54,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:02:54,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:02:54,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,463 INFO L137 Inliner]: procedures = 18, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2021-11-23 02:02:54,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:02:54,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:02:54,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:02:54,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:02:54,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:02:54,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:02:54,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:02:54,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:02:54,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (1/1) ... [2021-11-23 02:02:54,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:02:54,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:02:54,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:02:54,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:02:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:02:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 02:02:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:02:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-23 02:02:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:02:54,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:02:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-23 02:02:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:02:54,652 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:02:54,654 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:02:54,827 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:02:54,849 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:02:54,850 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-23 02:02:54,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:54 BoogieIcfgContainer [2021-11-23 02:02:54,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:02:54,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:02:54,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:02:54,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:02:54,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:02:54" (1/3) ... [2021-11-23 02:02:54,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2162a1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:02:54, skipping insertion in model container [2021-11-23 02:02:54,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:54" (2/3) ... [2021-11-23 02:02:54,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2162a1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:02:54, skipping insertion in model container [2021-11-23 02:02:54,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:54" (3/3) ... [2021-11-23 02:02:54,861 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2021-11-23 02:02:54,878 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:02:54,879 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 02:02:54,967 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:02:54,974 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-23 02:02:54,974 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 02:02:54,988 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-23 02:02:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 02:02:54,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:02:54,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:02:54,995 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:02:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:02:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1338621212, now seen corresponding path program 1 times [2021-11-23 02:02:55,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:02:55,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120299784] [2021-11-23 02:02:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:02:55,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:02:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:02:55,190 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-23 02:02:55,191 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:02:55,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120299784] [2021-11-23 02:02:55,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120299784] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:02:55,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:02:55,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:02:55,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410510954] [2021-11-23 02:02:55,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:02:55,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:02:55,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:02:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:02:55,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:02:55,247 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-23 02:02:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:02:55,411 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2021-11-23 02:02:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 02:02:55,414 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-23 02:02:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:02:55,424 INFO L225 Difference]: With dead ends: 44 [2021-11-23 02:02:55,425 INFO L226 Difference]: Without dead ends: 26 [2021-11-23 02:02:55,428 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-23 02:02:55,433 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:02:55,435 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.1s Time] [2021-11-23 02:02:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-23 02:02:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2021-11-23 02:02:55,488 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-23 02:02:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-11-23 02:02:55,490 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11 [2021-11-23 02:02:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:02:55,490 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-11-23 02:02:55,490 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-23 02:02:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-11-23 02:02:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 02:02:55,491 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:02:55,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:02:55,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:02:55,492 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:02:55,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:02:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1321610551, now seen corresponding path program 1 times [2021-11-23 02:02:55,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:02:55,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300364856] [2021-11-23 02:02:55,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:02:55,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:02:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:02:55,540 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-23 02:02:55,541 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:02:55,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300364856] [2021-11-23 02:02:55,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300364856] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:02:55,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:02:55,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:02:55,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045336425] [2021-11-23 02:02:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:02:55,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:02:55,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:02:55,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:02:55,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:02:55,545 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-23 02:02:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:02:55,560 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-11-23 02:02:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:02:55,561 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-23 02:02:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:02:55,562 INFO L225 Difference]: With dead ends: 33 [2021-11-23 02:02:55,562 INFO L226 Difference]: Without dead ends: 25 [2021-11-23 02:02:55,563 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-23 02:02:55,565 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-23 02:02:55,566 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-23 02:02:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-23 02:02:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2021-11-23 02:02:55,575 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-23 02:02:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2021-11-23 02:02:55,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2021-11-23 02:02:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:02:55,579 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-11-23 02:02:55,579 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-23 02:02:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2021-11-23 02:02:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 02:02:55,584 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:02:55,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:02:55,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 02:02:55,585 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:02:55,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:02:55,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1139004290, now seen corresponding path program 1 times [2021-11-23 02:02:55,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:02:55,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780437017] [2021-11-23 02:02:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:02:55,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:02:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:02:55,616 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 02:02:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:02:55,696 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-23 02:02:55,696 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 02:02:55,697 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 02:02:55,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 02:02:55,712 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-23 02:02:55,716 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 02:02:55,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:02:55 BoogieIcfgContainer [2021-11-23 02:02:55,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 02:02:55,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 02:02:55,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 02:02:55,767 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 02:02:55,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:54" (3/4) ... [2021-11-23 02:02:55,771 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-23 02:02:55,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 02:02:55,773 INFO L158 Benchmark]: Toolchain (without parser) took 1622.96ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 79.6MB in the beginning and 96.8MB in the end (delta: -17.2MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2021-11-23 02:02:55,774 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:02:55,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.18ms. Allocated memory is still 111.1MB. Free memory was 79.3MB in the beginning and 84.2MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 02:02:55,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.22ms. Allocated memory is still 111.1MB. Free memory was 84.2MB in the beginning and 82.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:02:55,783 INFO L158 Benchmark]: Boogie Preprocessor took 23.73ms. Allocated memory is still 111.1MB. Free memory was 82.5MB in the beginning and 81.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:02:55,786 INFO L158 Benchmark]: RCFGBuilder took 363.94ms. Allocated memory is still 111.1MB. Free memory was 81.2MB in the beginning and 70.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 02:02:55,786 INFO L158 Benchmark]: TraceAbstraction took 912.03ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 70.3MB in the beginning and 97.5MB in the end (delta: -27.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:02:55,787 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 134.2MB. Free memory was 97.5MB in the beginning and 96.8MB in the end (delta: 683.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:02:55,789 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.31ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.18ms. Allocated memory is still 111.1MB. Free memory was 79.3MB in the beginning and 84.2MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.22ms. Allocated memory is still 111.1MB. Free memory was 84.2MB in the beginning and 82.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.73ms. Allocated memory is still 111.1MB. Free memory was 82.5MB in the beginning and 81.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 363.94ms. Allocated memory is still 111.1MB. Free memory was 81.2MB in the beginning and 70.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 912.03ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 70.3MB in the beginning and 97.5MB in the end (delta: -27.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 134.2MB. Free memory was 97.5MB in the beginning and 96.8MB in the end (delta: 683.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, 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.1s 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-23 02:02:55,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/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_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/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_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V --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-aef121e [2021-11-23 02:02:58,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:02:58,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:02:58,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:02:58,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:02:58,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:02:58,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:02:58,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:02:58,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:02:58,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:02:58,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:02:58,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:02:58,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:02:58,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:02:58,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:02:58,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:02:58,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:02:58,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:02:58,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:02:58,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:02:58,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:02:58,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:02:58,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:02:58,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:02:58,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:02:58,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:02:58,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:02:58,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:02:58,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:02:58,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:02:58,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:02:58,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:02:58,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:02:58,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:02:58,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:02:58,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:02:58,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:02:58,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:02:58,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:02:58,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:02:58,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:02:58,426 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-23 02:02:58,462 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:02:58,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:02:58,463 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:02:58,463 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:02:58,464 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:02:58,464 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:02:58,465 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:02:58,465 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:02:58,465 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:02:58,465 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:02:58,466 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:02:58,467 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:02:58,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:02:58,469 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:02:58,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:02:58,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:02:58,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 02:02:58,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:02:58,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 02:02:58,470 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:02:58,470 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-23 02:02:58,471 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-23 02:02:58,471 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:02:58,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 02:02:58,471 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:02:58,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 02:02:58,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:02:58,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 02:02:58,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:02:58,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:02:58,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:02:58,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:02:58,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 02:02:58,474 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-23 02:02:58,474 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-23 02:02:58,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 02:02:58,474 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:02:58,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:02:58,475 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_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/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_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V 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-23 02:02:58,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:02:58,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:02:58,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:02:58,913 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:02:58,914 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:02:58,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-23 02:02:58,987 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/data/13ac6ecf7/44cb80c2c49448c18456841293f122f8/FLAG39065f3ce [2021-11-23 02:02:59,588 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:02:59,589 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-23 02:02:59,597 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/data/13ac6ecf7/44cb80c2c49448c18456841293f122f8/FLAG39065f3ce [2021-11-23 02:02:59,928 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/data/13ac6ecf7/44cb80c2c49448c18456841293f122f8 [2021-11-23 02:02:59,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:02:59,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:02:59,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:02:59,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:02:59,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:02:59,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:02:59" (1/1) ... [2021-11-23 02:02:59,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157a373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:59, skipping insertion in model container [2021-11-23 02:02:59,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:02:59" (1/1) ... [2021-11-23 02:02:59,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:02:59,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:03:00,166 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_7bfab07b-6198-4081-89d0-c256221713e7/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-23 02:03:00,180 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:03:00,227 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:03:00,276 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_7bfab07b-6198-4081-89d0-c256221713e7/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-23 02:03:00,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:03:00,294 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:03:00,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00 WrapperNode [2021-11-23 02:03:00,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:03:00,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:03:00,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:03:00,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:03:00,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (1/1) ... [2021-11-23 02:03:00,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (1/1) ... [2021-11-23 02:03:00,337 INFO L137 Inliner]: procedures = 19, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 100 [2021-11-23 02:03:00,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:03:00,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:03:00,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:03:00,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:03:00,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (1/1) ... [2021-11-23 02:03:00,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (1/1) ... [2021-11-23 02:03:00,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (1/1) ... [2021-11-23 02:03:00,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (1/1) ... [2021-11-23 02:03:00,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (1/1) ... [2021-11-23 02:03:00,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (1/1) ... [2021-11-23 02:03:00,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (1/1) ... [2021-11-23 02:03:00,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:03:00,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:03:00,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:03:00,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:03:00,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (1/1) ... [2021-11-23 02:03:00,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:03:00,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:03:00,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:03:00,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:03:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:03:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-23 02:03:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-23 02:03:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:03:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-23 02:03:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:03:00,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:03:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:03:00,632 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:03:00,633 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:03:02,069 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:03:02,076 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:03:02,076 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-23 02:03:02,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:03:02 BoogieIcfgContainer [2021-11-23 02:03:02,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:03:02,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:03:02,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:03:02,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:03:02,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:02:59" (1/3) ... [2021-11-23 02:03:02,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d42099a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:03:02, skipping insertion in model container [2021-11-23 02:03:02,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:00" (2/3) ... [2021-11-23 02:03:02,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d42099a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:03:02, skipping insertion in model container [2021-11-23 02:03:02,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:03:02" (3/3) ... [2021-11-23 02:03:02,086 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2021-11-23 02:03:02,092 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:03:02,092 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 02:03:02,158 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:03:02,164 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-23 02:03:02,165 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 02:03:02,178 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-23 02:03:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 02:03:02,184 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:03:02,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:03:02,191 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:03:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:03:02,197 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2021-11-23 02:03:02,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:03:02,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915419977] [2021-11-23 02:03:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:03:02,211 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:03:02,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:03:02,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:03:02,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-23 02:03:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:03:02,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 02:03:02,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:03:02,679 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-23 02:03:02,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:03:02,754 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-23 02:03:02,755 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:03:02,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915419977] [2021-11-23 02:03:02,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915419977] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:03:02,756 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:03:02,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-23 02:03:02,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118351449] [2021-11-23 02:03:02,759 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:03:02,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:03:02,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:03:02,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:03:02,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:03:02,795 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-23 02:03:04,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 02:03:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:03:05,018 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2021-11-23 02:03:05,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:03:05,022 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-23 02:03:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:03:05,030 INFO L225 Difference]: With dead ends: 35 [2021-11-23 02:03:05,030 INFO L226 Difference]: Without dead ends: 21 [2021-11-23 02:03:05,033 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-23 02:03:05,037 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-23 02:03:05,038 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-23 02:03:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-23 02:03:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-11-23 02:03:05,069 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-23 02:03:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-11-23 02:03:05,072 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 12 [2021-11-23 02:03:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:03:05,072 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-11-23 02:03:05,072 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-23 02:03:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2021-11-23 02:03:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 02:03:05,073 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:03:05,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:03:05,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-23 02:03:05,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:03:05,289 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:03:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:03:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2021-11-23 02:03:05,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:03:05,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491771276] [2021-11-23 02:03:05,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:03:05,292 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:03:05,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:03:05,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:03:05,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-23 02:03:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:03:05,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 02:03:05,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:03:05,700 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-23 02:03:05,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:03:05,768 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-23 02:03:05,769 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:03:05,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491771276] [2021-11-23 02:03:05,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491771276] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:03:05,769 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:03:05,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-23 02:03:05,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381063588] [2021-11-23 02:03:05,770 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:03:05,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:03:05,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:03:05,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:03:05,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:03:05,773 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-23 02:03:07,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 02:03:09,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 02:03:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:03:10,005 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-11-23 02:03:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:03:10,007 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-23 02:03:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:03:10,008 INFO L225 Difference]: With dead ends: 23 [2021-11-23 02:03:10,008 INFO L226 Difference]: Without dead ends: 19 [2021-11-23 02:03:10,009 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-23 02:03:10,010 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:03:10,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-11-23 02:03:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-23 02:03:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-23 02:03:10,016 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-23 02:03:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-23 02:03:10,017 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2021-11-23 02:03:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:03:10,017 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-23 02:03:10,017 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-23 02:03:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-23 02:03:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 02:03:10,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:03:10,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:03:10,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:03:10,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:03:10,241 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:03:10,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:03:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2021-11-23 02:03:10,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:03:10,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430663933] [2021-11-23 02:03:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:03:10,243 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:03:10,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:03:10,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:03:10,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-23 02:03:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:03:10,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:03:10,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:03:13,385 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:03:13,387 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-23 02:04:08,871 WARN L227 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:04:59,628 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-23 02:05:01,652 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-23 02:07:34,088 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-23 02:07:34,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:07:43,568 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-23 02:07:45,626 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-23 02:07:56,015 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-23 02:07:58,077 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-23 02:08:07,436 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-23 02:08:09,493 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-23 02:08:18,324 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-23 02:08:20,388 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-23 02:08:34,097 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-23 02:08:36,157 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-23 02:08:54,637 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-23 02:08:56,699 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-23 02:09:10,904 WARN L227 SmtUtils]: Spent 14.17s on a formula simplification. DAG size of input: 8 DAG size of output: 3 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-23 02:09:10,905 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 02:09:10,906 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-23 02:10:20,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ 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 ((_ 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)))) (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-23 02:10:22,347 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ 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 ((_ 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)))) (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-23 02:10:22,348 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-23 02:10:22,348 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:10:22,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430663933] [2021-11-23 02:10:22,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430663933] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:10:22,348 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:10:22,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-23 02:10:22,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400972546] [2021-11-23 02:10:22,349 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:10:22,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-23 02:10:22,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:10:22,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-23 02:10:22,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=69, Unknown=26, NotChecked=200, Total=342 [2021-11-23 02:10:22,352 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:10:24,458 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ 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 ((_ 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)))) (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-23 02:10:26,516 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ 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 ((_ 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)))) (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-23 02:10:28,551 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-23 02:10:30,611 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-23 02:10:33,618 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-23 02:10:35,660 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-23 02:10:37,719 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-23 02:10:39,763 WARN L838 $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 false [2021-11-23 02:10:41,824 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-23 02:10:43,875 WARN L838 $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 false [2021-11-23 02:10:45,938 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-23 02:10:47,993 WARN L838 $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 false [2021-11-23 02:10:50,055 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-23 02:10:52,115 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_2 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (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_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= |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))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-23 02:10:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:10:52,469 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2021-11-23 02:10:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:10:52,476 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-23 02:10:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:10:52,477 INFO L225 Difference]: With dead ends: 29 [2021-11-23 02:10:52,478 INFO L226 Difference]: Without dead ends: 24 [2021-11-23 02:10:52,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 101.9s TimeCoverageRelationStatistics Valid=63, Invalid=71, Unknown=40, NotChecked=528, Total=702 [2021-11-23 02:10:52,481 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:10:52,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 85 Unchecked, 0.4s Time] [2021-11-23 02:10:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-23 02:10:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-11-23 02:10:52,492 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-23 02:10:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2021-11-23 02:10:52,494 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2021-11-23 02:10:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:10:52,495 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2021-11-23 02:10:52,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:10:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2021-11-23 02:10:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 02:10:52,496 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:10:52,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:10:52,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:10:52,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:10:52,705 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:10:52,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:10:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2021-11-23 02:10:52,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:10:52,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129691582] [2021-11-23 02:10:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:10:52,707 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:10:52,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:10:52,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:10:52,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-23 02:10:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:10:53,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 02:10:53,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:10:53,156 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-23 02:10:53,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:10:53,214 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-23 02:10:53,215 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:10:53,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129691582] [2021-11-23 02:10:53,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129691582] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:10:53,215 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:10:53,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-23 02:10:53,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237042816] [2021-11-23 02:10:53,216 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:10:53,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:10:53,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:10:53,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:10:53,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:10:53,217 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-23 02:10:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:10:53,255 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-11-23 02:10:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:10:53,282 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-23 02:10:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:10:53,283 INFO L225 Difference]: With dead ends: 35 [2021-11-23 02:10:53,283 INFO L226 Difference]: Without dead ends: 20 [2021-11-23 02:10:53,283 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-23 02:10:53,285 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-23 02:10:53,285 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-23 02:10:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-23 02:10:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-23 02:10:53,292 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-23 02:10:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-23 02:10:53,293 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-23 02:10:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:10:53,293 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-23 02:10:53,293 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-23 02:10:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-23 02:10:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 02:10:53,294 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:10:53,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:10:53,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:10:53,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:10:53,495 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:10:53,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:10:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2021-11-23 02:10:53,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:10:53,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810567518] [2021-11-23 02:10:53,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:10:53,497 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:10:53,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:10:53,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:10:53,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfab07b-6198-4081-89d0-c256221713e7/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-23 02:10:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:10:54,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-23 02:10:54,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:10:58,908 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:10:58,909 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-23 02:11:51,785 WARN L227 SmtUtils]: Spent 12.16s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:12:32,838 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-23 02:13:54,789 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-23 02:13:56,828 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