./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 01:35:07,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 01:35:07,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 01:35:08,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 01:35:08,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 01:35:08,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 01:35:08,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 01:35:08,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 01:35:08,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 01:35:08,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 01:35:08,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 01:35:08,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 01:35:08,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 01:35:08,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 01:35:08,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 01:35:08,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 01:35:08,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 01:35:08,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 01:35:08,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 01:35:08,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 01:35:08,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 01:35:08,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 01:35:08,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 01:35:08,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 01:35:08,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 01:35:08,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 01:35:08,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 01:35:08,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 01:35:08,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 01:35:08,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 01:35:08,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 01:35:08,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 01:35:08,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 01:35:08,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 01:35:08,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 01:35:08,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 01:35:08,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 01:35:08,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 01:35:08,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 01:35:08,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 01:35:08,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 01:35:08,084 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-13 01:35:08,109 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 01:35:08,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 01:35:08,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 01:35:08,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 01:35:08,111 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-13 01:35:08,112 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-13 01:35:08,112 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-13 01:35:08,112 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-13 01:35:08,112 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-13 01:35:08,112 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-13 01:35:08,113 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-13 01:35:08,113 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-13 01:35:08,113 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-13 01:35:08,114 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-13 01:35:08,114 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-13 01:35:08,114 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-13 01:35:08,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 01:35:08,115 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 01:35:08,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 01:35:08,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 01:35:08,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 01:35:08,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 01:35:08,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 01:35:08,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 01:35:08,117 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 01:35:08,117 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 01:35:08,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 01:35:08,118 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 01:35:08,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 01:35:08,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 01:35:08,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 01:35:08,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 01:35:08,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 01:35:08,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 01:35:08,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 01:35:08,120 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-13 01:35:08,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 01:35:08,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 01:35:08,120 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 01:35:08,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-13 01:35:08,121 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_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 [2021-11-13 01:35:08,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 01:35:08,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 01:35:08,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 01:35:08,420 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 01:35:08,421 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 01:35:08,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2021-11-13 01:35:08,495 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/data/d2991dc1c/82558a53b14e4e138414b7352e10a8b4/FLAG492874fea [2021-11-13 01:35:09,092 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 01:35:09,094 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2021-11-13 01:35:09,107 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/data/d2991dc1c/82558a53b14e4e138414b7352e10a8b4/FLAG492874fea [2021-11-13 01:35:09,421 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/data/d2991dc1c/82558a53b14e4e138414b7352e10a8b4 [2021-11-13 01:35:09,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 01:35:09,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 01:35:09,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 01:35:09,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 01:35:09,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 01:35:09,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d59415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09, skipping insertion in model container [2021-11-13 01:35:09,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 01:35:09,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 01:35:09,697 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2021-11-13 01:35:09,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 01:35:09,715 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 01:35:09,738 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2021-11-13 01:35:09,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 01:35:09,760 INFO L208 MainTranslator]: Completed translation [2021-11-13 01:35:09,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09 WrapperNode [2021-11-13 01:35:09,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 01:35:09,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 01:35:09,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 01:35:09,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 01:35:09,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 01:35:09,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 01:35:09,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 01:35:09,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 01:35:09,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 01:35:09,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 01:35:09,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 01:35:09,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 01:35:09,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (1/1) ... [2021-11-13 01:35:09,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 01:35:09,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 01:35:09,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 01:35:09,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 01:35:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 01:35:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 01:35:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-13 01:35:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 01:35:09,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 01:35:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-13 01:35:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 01:35:10,242 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 01:35:10,243 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-13 01:35:10,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:10 BoogieIcfgContainer [2021-11-13 01:35:10,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 01:35:10,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 01:35:10,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 01:35:10,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 01:35:10,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:35:09" (1/3) ... [2021-11-13 01:35:10,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128bb59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:10, skipping insertion in model container [2021-11-13 01:35:10,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:09" (2/3) ... [2021-11-13 01:35:10,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128bb59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:10, skipping insertion in model container [2021-11-13 01:35:10,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:10" (3/3) ... [2021-11-13 01:35:10,273 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+nlh-reducer.c [2021-11-13 01:35:10,295 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 01:35:10,295 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 01:35:10,349 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 01:35:10,356 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-13 01:35:10,357 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 01:35:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 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-13 01:35:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-13 01:35:10,385 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:35:10,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:35:10,390 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:35:10,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:35:10,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1054039300, now seen corresponding path program 1 times [2021-11-13 01:35:10,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:35:10,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475552046] [2021-11-13 01:35:10,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:35:10,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:35:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:35:10,751 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-13 01:35:10,752 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:35:10,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475552046] [2021-11-13 01:35:10,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475552046] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:35:10,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:35:10,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 01:35:10,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848997993] [2021-11-13 01:35:10,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:35:10,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 01:35:10,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:35:10,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 01:35:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:35:10,800 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 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.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 01:35:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:35:10,944 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2021-11-13 01:35:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 01:35:10,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-13 01:35:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:35:10,958 INFO L225 Difference]: With dead ends: 35 [2021-11-13 01:35:10,959 INFO L226 Difference]: Without dead ends: 21 [2021-11-13 01:35:10,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-13 01:35:10,968 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.60ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.75ms IncrementalHoareTripleChecker+Time [2021-11-13 01:35:10,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 87 Invalid, 25 Unknown, 0 Unchecked, 7.60ms Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 43.75ms Time] [2021-11-13 01:35:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-13 01:35:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-13 01:35:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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-13 01:35:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-11-13 01:35:11,011 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2021-11-13 01:35:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:35:11,012 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-11-13 01:35:11,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 01:35:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2021-11-13 01:35:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-13 01:35:11,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:35:11,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:35:11,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 01:35:11,016 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:35:11,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:35:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1037028639, now seen corresponding path program 1 times [2021-11-13 01:35:11,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:35:11,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47134292] [2021-11-13 01:35:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:35:11,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:35:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 01:35:11,072 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 01:35:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 01:35:11,157 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-13 01:35:11,158 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-13 01:35:11,161 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-13 01:35:11,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 01:35:11,169 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-13 01:35:11,172 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 01:35:11,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:35:11 BoogieIcfgContainer [2021-11-13 01:35:11,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 01:35:11,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 01:35:11,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 01:35:11,244 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 01:35:11,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:10" (3/4) ... [2021-11-13 01:35:11,248 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-13 01:35:11,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 01:35:11,250 INFO L158 Benchmark]: Toolchain (without parser) took 1825.24ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 57.8MB in the beginning and 96.8MB in the end (delta: -39.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 01:35:11,251 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 94.4MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 01:35:11,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.18ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 57.6MB in the beginning and 107.4MB in the end (delta: -49.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2021-11-13 01:35:11,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.15ms. Allocated memory is still 132.1MB. Free memory was 107.4MB in the beginning and 105.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 01:35:11,259 INFO L158 Benchmark]: Boogie Preprocessor took 31.15ms. Allocated memory is still 132.1MB. Free memory was 105.7MB in the beginning and 104.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 01:35:11,260 INFO L158 Benchmark]: RCFGBuilder took 407.25ms. Allocated memory is still 132.1MB. Free memory was 104.2MB in the beginning and 91.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-13 01:35:11,260 INFO L158 Benchmark]: TraceAbstraction took 994.32ms. Allocated memory is still 132.1MB. Free memory was 91.0MB in the beginning and 96.9MB in the end (delta: -6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 01:35:11,261 INFO L158 Benchmark]: Witness Printer took 5.73ms. Allocated memory is still 132.1MB. Free memory was 96.9MB in the beginning and 96.8MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 01:35:11,272 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 94.4MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.18ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 57.6MB in the beginning and 107.4MB in the end (delta: -49.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.15ms. Allocated memory is still 132.1MB. Free memory was 107.4MB in the beginning and 105.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.15ms. Allocated memory is still 132.1MB. Free memory was 105.7MB in the beginning and 104.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 407.25ms. Allocated memory is still 132.1MB. Free memory was 104.2MB in the beginning and 91.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 994.32ms. Allocated memory is still 132.1MB. Free memory was 91.0MB in the beginning and 96.9MB in the end (delta: -6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.73ms. Allocated memory is still 132.1MB. Free memory was 96.9MB in the beginning and 96.8MB in the end (delta: 125.9kB). 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 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_132; [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; [L22] EXPR main__min[0] VAL [__return_132=0, __return_main=0, main__max={5:0}, main__min={6:0}, main__min[0]=51] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_132=0, __return_main=0, main__max={5:0}, main__max[4UL]=50, main__min={6:0}] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={5:0}, main__min={6:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={6:0}] [L30] COND TRUE main__i < 5UL [L32] EXPR main__max[main__i] VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__max[main__i]=49, main__min={6:0}] [L32] 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_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={6:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={6:0}] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={6: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_132=0, __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={5:0}, main__min={6:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_132=0, __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={5:0}, main__min={6:0}] [L51] reach_error() VAL [__return_132=0, __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={5:0}, main__min={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 43.75ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 36.42ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 29 mSDtfsCounter, 23 mSolverCounterSat, 7.60ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-13 01:35:11,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 01:35:13,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 01:35:13,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 01:35:13,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 01:35:13,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 01:35:13,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 01:35:13,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 01:35:13,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 01:35:13,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 01:35:13,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 01:35:13,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 01:35:13,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 01:35:13,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 01:35:13,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 01:35:13,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 01:35:13,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 01:35:13,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 01:35:13,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 01:35:13,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 01:35:13,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 01:35:13,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 01:35:13,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 01:35:13,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 01:35:13,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 01:35:13,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 01:35:13,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 01:35:13,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 01:35:13,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 01:35:13,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 01:35:13,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 01:35:13,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 01:35:13,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 01:35:13,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 01:35:13,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 01:35:13,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 01:35:13,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 01:35:13,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 01:35:13,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 01:35:13,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 01:35:13,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 01:35:13,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 01:35:13,806 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-13 01:35:13,854 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 01:35:13,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 01:35:13,856 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 01:35:13,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 01:35:13,857 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-13 01:35:13,857 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-13 01:35:13,857 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-13 01:35:13,858 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-13 01:35:13,858 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-13 01:35:13,858 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-13 01:35:13,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 01:35:13,861 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 01:35:13,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 01:35:13,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 01:35:13,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 01:35:13,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 01:35:13,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 01:35:13,862 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 01:35:13,863 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-13 01:35:13,863 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-13 01:35:13,863 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 01:35:13,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 01:35:13,863 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 01:35:13,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 01:35:13,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 01:35:13,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 01:35:13,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 01:35:13,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 01:35:13,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 01:35:13,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 01:35:13,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 01:35:13,866 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-13 01:35:13,866 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-13 01:35:13,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 01:35:13,867 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 01:35:13,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-13 01:35:13,867 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_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 [2021-11-13 01:35:14,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 01:35:14,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 01:35:14,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 01:35:14,340 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 01:35:14,341 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 01:35:14,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2021-11-13 01:35:14,419 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/data/2d097117c/81f58dd4755e4a7992f1bb46a8107552/FLAGe31adc2f0 [2021-11-13 01:35:15,044 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 01:35:15,045 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2021-11-13 01:35:15,053 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/data/2d097117c/81f58dd4755e4a7992f1bb46a8107552/FLAGe31adc2f0 [2021-11-13 01:35:15,351 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/data/2d097117c/81f58dd4755e4a7992f1bb46a8107552 [2021-11-13 01:35:15,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 01:35:15,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 01:35:15,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 01:35:15,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 01:35:15,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 01:35:15,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320cc555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15, skipping insertion in model container [2021-11-13 01:35:15,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 01:35:15,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 01:35:15,558 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2021-11-13 01:35:15,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 01:35:15,584 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 01:35:15,640 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2021-11-13 01:35:15,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 01:35:15,677 INFO L208 MainTranslator]: Completed translation [2021-11-13 01:35:15,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15 WrapperNode [2021-11-13 01:35:15,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 01:35:15,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 01:35:15,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 01:35:15,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 01:35:15,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 01:35:15,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 01:35:15,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 01:35:15,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 01:35:15,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 01:35:15,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 01:35:15,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 01:35:15,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 01:35:15,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (1/1) ... [2021-11-13 01:35:15,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 01:35:15,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 01:35:15,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 01:35:15,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 01:35:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-13 01:35:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-13 01:35:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 01:35:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-13 01:35:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 01:35:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 01:35:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 01:35:17,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 01:35:17,092 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-13 01:35:17,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:17 BoogieIcfgContainer [2021-11-13 01:35:17,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 01:35:17,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 01:35:17,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 01:35:17,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 01:35:17,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:35:15" (1/3) ... [2021-11-13 01:35:17,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1af517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:17, skipping insertion in model container [2021-11-13 01:35:17,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:15" (2/3) ... [2021-11-13 01:35:17,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1af517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:17, skipping insertion in model container [2021-11-13 01:35:17,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:17" (3/3) ... [2021-11-13 01:35:17,136 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+nlh-reducer.c [2021-11-13 01:35:17,160 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 01:35:17,160 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 01:35:17,206 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 01:35:17,213 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-13 01:35:17,214 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 01:35:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 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-13 01:35:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-13 01:35:17,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:35:17,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:35:17,234 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:35:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:35:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2021-11-13 01:35:17,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 01:35:17,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738782355] [2021-11-13 01:35:17,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:35:17,255 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 01:35:17,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 01:35:17,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 01:35:17,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-13 01:35:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:35:17,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-13 01:35:17,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 01:35:17,828 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-13 01:35:17,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 01:35:17,939 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-13 01:35:17,940 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 01:35:17,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738782355] [2021-11-13 01:35:17,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738782355] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-13 01:35:17,942 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:35:17,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-13 01:35:17,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825765703] [2021-11-13 01:35:17,945 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-13 01:35:17,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 01:35:17,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-13 01:35:17,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 01:35:17,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-13 01:35:17,983 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 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 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-13 01:35:20,096 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 01:35:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:35:20,229 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2021-11-13 01:35:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 01:35:20,232 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-13 01:35:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:35:20,243 INFO L225 Difference]: With dead ends: 38 [2021-11-13 01:35:20,243 INFO L226 Difference]: Without dead ends: 22 [2021-11-13 01:35:20,246 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-13 01:35:20,254 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2147.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.87ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2194.13ms IncrementalHoareTripleChecker+Time [2021-11-13 01:35:20,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 15 Unknown, 0 Unchecked, 2.87ms Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2194.13ms Time] [2021-11-13 01:35:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-13 01:35:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-13 01:35:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-13 01:35:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-11-13 01:35:20,299 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2021-11-13 01:35:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:35:20,300 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-11-13 01:35:20,301 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-13 01:35:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-11-13 01:35:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-13 01:35:20,303 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:35:20,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:35:20,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-13 01:35:20,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-13 01:35:20,505 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:35:20,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:35:20,506 INFO L85 PathProgramCache]: Analyzing trace with hash 792769235, now seen corresponding path program 1 times [2021-11-13 01:35:20,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 01:35:20,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023377154] [2021-11-13 01:35:20,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:35:20,507 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 01:35:20,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 01:35:20,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 01:35:20,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-13 01:35:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:35:20,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-13 01:35:20,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 01:35:23,651 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-13 01:35:23,652 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-13 01:35:47,710 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)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-13 01:36:42,642 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-13 01:36:44,672 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-13 01:39:16,798 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-13 01:39:16,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 01:39:24,334 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-13 01:39:26,387 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-13 01:39:36,754 WARN L838 $PredicateComparison]: unable to prove that (or (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)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem10#1|))) is different from false [2021-11-13 01:39:38,807 WARN L860 $PredicateComparison]: unable to prove that (or (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)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem10#1|))) is different from true [2021-11-13 01:39:49,200 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-13 01:39:51,259 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-13 01:40:01,678 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-13 01:40:03,735 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-13 01:40:18,347 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~mem9#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-13 01:40:20,404 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~mem9#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-13 01:40:35,816 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.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (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)) (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-13 01:40:37,870 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.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (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)) (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-13 01:40:52,104 WARN L227 SmtUtils]: Spent 14.19s 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-13 01:40:52,105 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-13 01:40:52,106 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-13 01:42:00,197 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)))))) is different from false [2021-11-13 01:42:02,264 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)))))) is different from true [2021-11-13 01:42:02,265 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-13 01:42:02,265 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 01:42:02,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023377154] [2021-11-13 01:42:02,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023377154] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-13 01:42:02,266 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:42:02,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-13 01:42:02,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890087876] [2021-11-13 01:42:02,268 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-13 01:42:02,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-13 01:42:02,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-13 01:42:02,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-13 01:42:02,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=63, Unknown=17, NotChecked=216, Total=342 [2021-11-13 01:42:02,273 INFO L87 Difference]: Start difference. First operand 22 states and 27 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-13 01:42:04,473 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-13 01:42:06,535 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-13 01:42:08,567 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)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (= (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))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse4 (let ((.cse7 (select .cse3 |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.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse2 (select .cse3 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (let ((.cse6 (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) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse5) (fp.sub c_currentRoundingMode .cse4 .cse5)))) (_ +zero 11 53)))))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse8) (= |c_ULTIMATE.start_main_#t~mem8#1| .cse8) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse9 (select .cse1 |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-13 01:42:10,626 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)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (= (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))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse4 (let ((.cse7 (select .cse3 |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.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse2 (select .cse3 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (let ((.cse6 (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) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse5) (fp.sub c_currentRoundingMode .cse4 .cse5)))) (_ +zero 11 53)))))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse8) (= |c_ULTIMATE.start_main_#t~mem8#1| .cse8) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse9 (select .cse1 |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-13 01:42:12,666 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse0 (let ((.cse4 (select .cse5 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse2 (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))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse1 .cse2))) (_ +zero 11 53))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem9#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse2)))) is different from false [2021-11-13 01:42:14,728 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse0 (let ((.cse4 (select .cse5 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse2 (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))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse1 .cse2))) (_ +zero 11 53))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem9#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse2)))) is different from true [2021-11-13 01:42:16,771 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-13 01:42:18,829 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-13 01:42:20,870 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-13 01:42:22,932 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-13 01:42:26,584 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 (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)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem10#1|))) (= .cse3 |c_ULTIMATE.start_main_#t~mem10#1|) (= |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) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)))) is different from true [2021-11-13 01:42:28,641 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-13 01:42:30,712 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-13 01:42:32,773 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-13 01:42:33,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:42:33,418 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2021-11-13 01:42:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 01:42:33,420 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-13 01:42:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:42:33,421 INFO L225 Difference]: With dead ends: 29 [2021-11-13 01:42:33,422 INFO L226 Difference]: Without dead ends: 24 [2021-11-13 01:42:33,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 67.2s TimeCoverageRelationStatistics Valid=62, Invalid=65, Unknown=31, NotChecked=544, Total=702 [2021-11-13 01:42:33,424 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 683.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.25ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 736.04ms IncrementalHoareTripleChecker+Time [2021-11-13 01:42:33,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 182 Unknown, 0 Unchecked, 2.25ms Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 155 Unchecked, 736.04ms Time] [2021-11-13 01:42:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-13 01:42:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-11-13 01:42:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-13 01:42:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-11-13 01:42:33,433 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2021-11-13 01:42:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:42:33,433 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-11-13 01:42:33,433 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-13 01:42:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-11-13 01:42:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-13 01:42:33,434 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:42:33,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:42:33,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-13 01:42:33,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-13 01:42:33,635 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:42:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:42:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1710804433, now seen corresponding path program 1 times [2021-11-13 01:42:33,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 01:42:33,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865587688] [2021-11-13 01:42:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:42:33,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 01:42:33,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 01:42:33,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 01:42:33,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89960308-7edc-4ede-b96f-bb40fc9ba2e4/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-13 01:42:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:42:35,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-13 01:42:35,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 01:42:38,692 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-13 01:42:38,692 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-13 01:43:07,334 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-13 01:43:43,627 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-13 01:45:04,312 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2))))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (fp.geq .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from false [2021-11-13 01:45:06,351 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2))))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (fp.geq .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from true [2021-11-13 01:48:53,829 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-13 01:48:53,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 01:49:08,479 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (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) .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| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (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) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1))))))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2021-11-13 01:49:10,546 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (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) .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| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (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) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1))))))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-11-13 01:49:25,281 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (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) .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| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (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) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1))))))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem10#1|)))) is different from false [2021-11-13 01:49:27,352 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (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) .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| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (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) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1))))))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem10#1|)))) is different from true [2021-11-13 01:49:42,025 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse4 |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| .cse2) (fp.sub c_currentRoundingMode .cse1 .cse2)))))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)))))) is different from false [2021-11-13 01:49:44,085 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse4 |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| .cse2) (fp.sub c_currentRoundingMode .cse1 .cse2)))))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)))))) is different from true