./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/loop-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/loop-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:24:07,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:24:07,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:24:07,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:24:07,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:24:07,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:24:07,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:24:07,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:24:07,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:24:07,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:24:07,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:24:07,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:24:07,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:24:07,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:24:07,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:24:07,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:24:07,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:24:07,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:24:07,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:24:07,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:24:07,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:24:07,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:24:07,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:24:07,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:24:07,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:24:07,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:24:07,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:24:07,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:24:07,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:24:07,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:24:07,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:24:07,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:24:07,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:24:07,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:24:07,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:24:07,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:24:07,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:24:07,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:24:07,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:24:07,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:24:07,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:24:07,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:24:07,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:24:07,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:24:07,943 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:24:07,944 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:24:07,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:24:07,944 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:24:07,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:24:07,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:24:07,945 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:24:07,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:24:07,946 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:24:07,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:24:07,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:24:07,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:24:07,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:24:07,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:24:07,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:24:07,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:24:07,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:24:07,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:24:07,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:24:07,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:24:07,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:24:07,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:24:07,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:07,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:24:07,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:24:07,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:24:07,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:24:07,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:24:07,950 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:24:07,950 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:24:07,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:24:07,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-02-20 16:24:08,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:24:08,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:24:08,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:24:08,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:24:08,149 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:24:08,150 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/loop-1.c [2022-02-20 16:24:08,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/386182f19/d5a5a14a29de42afa5a7af3c1dd18025/FLAGa31938ec6 [2022-02-20 16:24:08,534 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:24:08,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/loop-1.c [2022-02-20 16:24:08,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/386182f19/d5a5a14a29de42afa5a7af3c1dd18025/FLAGa31938ec6 [2022-02-20 16:24:08,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/386182f19/d5a5a14a29de42afa5a7af3c1dd18025 [2022-02-20 16:24:08,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:24:08,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:24:08,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:08,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:24:08,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:24:08,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51028e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08, skipping insertion in model container [2022-02-20 16:24:08,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:24:08,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:24:09,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-02-20 16:24:09,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:09,135 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:24:09,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-02-20 16:24:09,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:09,162 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:24:09,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09 WrapperNode [2022-02-20 16:24:09,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:09,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:09,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:24:09,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:24:09,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (1/1) ... [2022-02-20 16:24:09,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (1/1) ... [2022-02-20 16:24:09,191 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-02-20 16:24:09,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:09,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:24:09,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:24:09,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:24:09,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (1/1) ... [2022-02-20 16:24:09,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (1/1) ... [2022-02-20 16:24:09,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (1/1) ... [2022-02-20 16:24:09,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (1/1) ... [2022-02-20 16:24:09,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (1/1) ... [2022-02-20 16:24:09,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (1/1) ... [2022-02-20 16:24:09,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (1/1) ... [2022-02-20 16:24:09,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:24:09,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:24:09,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:24:09,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:24:09,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (1/1) ... [2022-02-20 16:24:09,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:09,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:24:09,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:24:09,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:24:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:24:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:24:09,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:24:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:24:09,307 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:24:09,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:24:09,412 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:24:09,416 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:24:09,417 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:24:09,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:09 BoogieIcfgContainer [2022-02-20 16:24:09,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:24:09,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:24:09,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:24:09,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:24:09,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:24:08" (1/3) ... [2022-02-20 16:24:09,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a07c530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:09, skipping insertion in model container [2022-02-20 16:24:09,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:09" (2/3) ... [2022-02-20 16:24:09,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a07c530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:09, skipping insertion in model container [2022-02-20 16:24:09,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:09" (3/3) ... [2022-02-20 16:24:09,424 INFO L111 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-02-20 16:24:09,430 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:24:09,430 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:24:09,459 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:24:09,463 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=PETRI_NET, 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 [2022-02-20 16:24:09,463 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:24:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:24:09,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:09,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:24:09,477 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:09,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-02-20 16:24:09,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:24:09,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469396769] [2022-02-20 16:24:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:24:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:24:09,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:24:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:24:09,567 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:24:09,568 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:24:09,569 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:24:09,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:24:09,574 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-02-20 16:24:09,576 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:24:09,592 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:24:09,592 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:24:09,592 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-20 16:24:09,592 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-20 16:24:09,592 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-20 16:24:09,592 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2022-02-20 16:24:09,593 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-02-20 16:24:09,593 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-02-20 16:24:09,593 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-02-20 16:24:09,593 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-02-20 16:24:09,593 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2022-02-20 16:24:09,593 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:24:09,593 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:24:09,594 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:24:09,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:24:09 BoogieIcfgContainer [2022-02-20 16:24:09,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:24:09,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:24:09,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:24:09,595 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:24:09,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:09" (3/4) ... [2022-02-20 16:24:09,598 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:24:09,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:24:09,599 INFO L158 Benchmark]: Toolchain (without parser) took 621.65ms. Allocated memory is still 130.0MB. Free memory was 93.6MB in the beginning and 77.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,600 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory was 100.6MB in the beginning and 100.5MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:09,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.41ms. Allocated memory is still 130.0MB. Free memory was 93.6MB in the beginning and 104.1MB in the end (delta: -10.5MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.65ms. Allocated memory is still 130.0MB. Free memory was 103.5MB in the beginning and 102.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,601 INFO L158 Benchmark]: Boogie Preprocessor took 19.51ms. Allocated memory is still 130.0MB. Free memory was 102.0MB in the beginning and 101.3MB in the end (delta: 731.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,604 INFO L158 Benchmark]: RCFGBuilder took 205.14ms. Allocated memory is still 130.0MB. Free memory was 101.3MB in the beginning and 92.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,604 INFO L158 Benchmark]: TraceAbstraction took 175.01ms. Allocated memory is still 130.0MB. Free memory was 91.5MB in the beginning and 77.6MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,605 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 130.0MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:09,610 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory was 100.6MB in the beginning and 100.5MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.41ms. Allocated memory is still 130.0MB. Free memory was 93.6MB in the beginning and 104.1MB in the end (delta: -10.5MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.65ms. Allocated memory is still 130.0MB. Free memory was 103.5MB in the beginning and 102.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.51ms. Allocated memory is still 130.0MB. Free memory was 102.0MB in the beginning and 101.3MB in the end (delta: 731.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 205.14ms. Allocated memory is still 130.0MB. Free memory was 101.3MB in the beginning and 92.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 175.01ms. Allocated memory is still 130.0MB. Free memory was 91.5MB in the beginning and 77.6MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 130.0MB. Free memory is still 77.6MB. 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: 4]: 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 20, overapproximation of someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f VAL [x=1, y=10000000, z=42] [L14] COND FALSE !(x < y) VAL [x=1, y=10000000, z=42] [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 [2022-02-20 16:24:09,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/loop-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:24:11,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:24:11,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:24:11,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:24:11,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:24:11,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:24:11,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:24:11,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:24:11,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:24:11,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:24:11,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:24:11,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:24:11,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:24:11,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:24:11,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:24:11,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:24:11,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:24:11,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:24:11,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:24:11,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:24:11,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:24:11,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:24:11,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:24:11,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:24:11,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:24:11,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:24:11,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:24:11,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:24:11,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:24:11,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:24:11,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:24:11,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:24:11,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:24:11,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:24:11,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:24:11,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:24:11,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:24:11,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:24:11,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:24:11,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:24:11,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:24:11,311 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:24:11,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:24:11,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:24:11,341 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:24:11,341 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:24:11,342 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:24:11,342 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:24:11,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:24:11,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:24:11,343 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:24:11,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:24:11,344 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:24:11,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:24:11,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:24:11,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:24:11,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:24:11,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:24:11,345 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:24:11,345 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:24:11,345 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:24:11,346 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:24:11,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:24:11,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:24:11,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:24:11,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:24:11,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:24:11,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:24:11,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:11,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:24:11,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:24:11,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:24:11,347 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:24:11,347 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:24:11,348 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:24:11,348 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:24:11,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:24:11,348 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:24:11,348 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-02-20 16:24:11,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:24:11,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:24:11,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:24:11,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:24:11,621 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:24:11,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/loop-1.c [2022-02-20 16:24:11,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9ea899c/90c998d888ab4084a0c7cd86eeb0e713/FLAG5d7528101 [2022-02-20 16:24:12,057 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:24:12,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/loop-1.c [2022-02-20 16:24:12,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9ea899c/90c998d888ab4084a0c7cd86eeb0e713/FLAG5d7528101 [2022-02-20 16:24:12,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9ea899c/90c998d888ab4084a0c7cd86eeb0e713 [2022-02-20 16:24:12,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:24:12,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:24:12,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:12,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:24:12,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:24:12,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff11d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12, skipping insertion in model container [2022-02-20 16:24:12,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:24:12,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:24:12,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-02-20 16:24:12,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:12,231 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:24:12,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-02-20 16:24:12,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:12,282 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:24:12,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12 WrapperNode [2022-02-20 16:24:12,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:12,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:12,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:24:12,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:24:12,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,313 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-02-20 16:24:12,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:12,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:24:12,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:24:12,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:24:12,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:24:12,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:24:12,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:24:12,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:24:12,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:12,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:24:12,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:24:12,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:24:12,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:24:12,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:24:12,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:24:12,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:24:12,468 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:24:12,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:24:12,941 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:24:12,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:24:12,945 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:24:12,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:12 BoogieIcfgContainer [2022-02-20 16:24:12,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:24:12,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:24:12,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:24:12,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:24:12,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:24:12" (1/3) ... [2022-02-20 16:24:12,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bce9ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:12, skipping insertion in model container [2022-02-20 16:24:12,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (2/3) ... [2022-02-20 16:24:12,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bce9ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:12, skipping insertion in model container [2022-02-20 16:24:12,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:12" (3/3) ... [2022-02-20 16:24:12,951 INFO L111 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-02-20 16:24:12,955 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:24:12,955 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:24:12,985 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:24:12,995 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=PETRI_NET, 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 [2022-02-20 16:24:12,996 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:24:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:24:13,008 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:13,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:24:13,009 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-02-20 16:24:13,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:13,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706531975] [2022-02-20 16:24:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:13,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:13,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:13,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:24:13,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:24:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:13,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:24:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:13,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:24:13,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {14#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {14#true} is VALID [2022-02-20 16:24:13,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {14#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := ~to_fp~FLOAT(currentRoundingMode, 1.0);main_~y~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E7));main_~z~0#1 := ~to_fp~FLOAT(currentRoundingMode, 42.0); {22#(exists ((currentRoundingMode RoundingMode)) (and (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) |ULTIMATE.start_main_~y~0#1|) (= ((_ to_fp 8 24) currentRoundingMode 1.0) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 16:24:13,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#(exists ((currentRoundingMode RoundingMode)) (and (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) |ULTIMATE.start_main_~y~0#1|) (= ((_ to_fp 8 24) currentRoundingMode 1.0) |ULTIMATE.start_main_~x~0#1|)))} assume !~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1); {15#false} is VALID [2022-02-20 16:24:13,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {15#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~z~0#1, ~Pluszero~FLOAT()) && ~fp.leq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~z~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0E8)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {15#false} is VALID [2022-02-20 16:24:13,202 INFO L290 TraceCheckUtils]: 4: Hoare triple {15#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {15#false} is VALID [2022-02-20 16:24:13,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {15#false} assume !false; {15#false} is VALID [2022-02-20 16:24:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:24:13,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:24:13,204 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:24:13,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706531975] [2022-02-20 16:24:13,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706531975] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:24:13,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:24:13,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:24:13,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280657743] [2022-02-20 16:24:13,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:24:13,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 16:24:13,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:24:13,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-20 16:24:13,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:13,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:24:13,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:24:13,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:24:13,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:24:13,252 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-20 16:24:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:13,384 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-20 16:24:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:24:13,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 16:24:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:24:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-20 16:24:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 16:24:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-20 16:24:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 16:24:13,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-20 16:24:13,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:13,503 INFO L225 Difference]: With dead ends: 20 [2022-02-20 16:24:13,503 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 16:24:13,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:24:13,507 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:24:13,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2022-02-20 16:24:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 16:24:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 16:24:13,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:13,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 16:24:13,526 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 16:24:13,526 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 16:24:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:13,527 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 16:24:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 16:24:13,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:13,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:13,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-20 16:24:13,534 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-20 16:24:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:13,535 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 16:24:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 16:24:13,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:13,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:13,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:13,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 16:24:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 16:24:13,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-02-20 16:24:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:13,538 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 16:24:13,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-20 16:24:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 16:24:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:24:13,539 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:13,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:13,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:24:13,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:24:13,748 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:13,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-02-20 16:24:13,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:13,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565408847] [2022-02-20 16:24:13,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:13,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:13,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:13,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:24:13,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:24:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:13,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:24:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:13,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:24:13,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {91#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:13,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {91#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := ~to_fp~FLOAT(currentRoundingMode, 1.0);main_~y~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E7));main_~z~0#1 := ~to_fp~FLOAT(currentRoundingMode, 42.0); {95#(and (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) |ULTIMATE.start_main_~y~0#1|) (= ((_ to_fp 8 24) currentRoundingMode 1.0) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:13,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#(and (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) |ULTIMATE.start_main_~y~0#1|) (= ((_ to_fp 8 24) currentRoundingMode 1.0) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1);main_~x~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~y~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {99#(and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~x~0#1|) (= (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 10000000.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:24:13,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {99#(and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~x~0#1|) (= (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 10000000.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~y~0#1|))} assume !~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1); {87#false} is VALID [2022-02-20 16:24:13,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {87#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~z~0#1, ~Pluszero~FLOAT()) && ~fp.leq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~z~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0E8)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {87#false} is VALID [2022-02-20 16:24:13,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {87#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {87#false} is VALID [2022-02-20 16:24:13,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {87#false} assume !false; {87#false} is VALID [2022-02-20 16:24:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:24:13,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:24:17,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {87#false} assume !false; {87#false} is VALID [2022-02-20 16:24:17,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {87#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {87#false} is VALID [2022-02-20 16:24:17,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {87#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~z~0#1, ~Pluszero~FLOAT()) && ~fp.leq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~z~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0E8)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {87#false} is VALID [2022-02-20 16:24:17,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#(fp.lt |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)} assume !~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1); {87#false} is VALID [2022-02-20 16:24:17,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#(fp.lt (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.sub currentRoundingMode |ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)))} assume !!~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1);main_~x~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~y~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {121#(fp.lt |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 16:24:17,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := ~to_fp~FLOAT(currentRoundingMode, 1.0);main_~y~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E7));main_~z~0#1 := ~to_fp~FLOAT(currentRoundingMode, 42.0); {125#(fp.lt (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.sub currentRoundingMode |ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)))} is VALID [2022-02-20 16:24:17,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {86#true} is VALID [2022-02-20 16:24:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:24:17,264 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:24:17,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565408847] [2022-02-20 16:24:17,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565408847] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:24:17,265 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:24:17,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-20 16:24:17,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522489177] [2022-02-20 16:24:17,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:24:17,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:24:17,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:24:17,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:17,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:17,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:24:17,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:24:17,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:24:17,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2022-02-20 16:24:17,537 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:27,774 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 16:24:27,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:24:27,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:24:27,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:24:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-02-20 16:24:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-02-20 16:24:27,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 17 transitions. [2022-02-20 16:24:28,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:28,439 INFO L225 Difference]: With dead ends: 15 [2022-02-20 16:24:28,439 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 16:24:28,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=36, Invalid=53, Unknown=1, NotChecked=0, Total=90 [2022-02-20 16:24:28,440 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:24:28,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-02-20 16:24:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 16:24:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 16:24:28,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:28,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:28,443 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:28,443 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:28,444 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:24:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:24:28,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:28,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:28,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 16:24:28,444 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 16:24:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:28,445 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:24:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:24:28,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:28,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:28,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:28,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-02-20 16:24:28,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-02-20 16:24:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:28,448 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-02-20 16:24:28,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:24:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:24:28,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:28,449 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:28,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:24:28,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:24:28,650 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:28,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-02-20 16:24:28,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:28,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987407879] [2022-02-20 16:24:28,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:24:28,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:28,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:28,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:24:28,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:24:28,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:24:28,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:24:28,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 16:24:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:28,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:24:29,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {195#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {200#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:29,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := ~to_fp~FLOAT(currentRoundingMode, 1.0);main_~y~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E7));main_~z~0#1 := ~to_fp~FLOAT(currentRoundingMode, 42.0); {204#(and (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) |ULTIMATE.start_main_~y~0#1|) (= ((_ to_fp 8 24) currentRoundingMode 1.0) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:29,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#(and (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) |ULTIMATE.start_main_~y~0#1|) (= ((_ to_fp 8 24) currentRoundingMode 1.0) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1);main_~x~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~y~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {208#(and (= (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~x~0#1|) (= (fp.sub currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:29,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {208#(and (= (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~x~0#1|) (= (fp.sub currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1);main_~x~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~y~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {212#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~x~0#1|) (= (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:29,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {212#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~x~0#1|) (= (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1);main_~x~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~y~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {216#(and (= (fp.sub currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~y~0#1|) (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:29,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(and (= (fp.sub currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 10000000.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~y~0#1|) (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1);main_~x~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~y~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {220#(and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~x~0#1|) (= (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 10000000.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:24:29,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~x~0#1|) (= (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 10000000.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~y~0#1|))} assume !~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1); {196#false} is VALID [2022-02-20 16:24:29,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~z~0#1, ~Pluszero~FLOAT()) && ~fp.leq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~z~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0E8)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {196#false} is VALID [2022-02-20 16:24:29,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {196#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {196#false} is VALID [2022-02-20 16:24:29,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-02-20 16:24:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:24:29,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:25:18,500 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from false [2022-02-20 16:25:20,529 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from true [2022-02-20 16:25:20,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-02-20 16:25:20,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {196#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {196#false} is VALID [2022-02-20 16:25:20,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~z~0#1, ~Pluszero~FLOAT()) && ~fp.leq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~z~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0E8)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {196#false} is VALID [2022-02-20 16:25:20,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {242#(fp.lt |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)} assume !~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1); {196#false} is VALID [2022-02-20 16:25:20,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#(fp.lt (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.sub currentRoundingMode |ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)))} assume !!~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1);main_~x~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~y~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {242#(fp.lt |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 16:25:20,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {250#(fp.lt (fp.add currentRoundingMode (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.sub currentRoundingMode (fp.sub currentRoundingMode |ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} assume !!~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1);main_~x~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~y~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {246#(fp.lt (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.sub currentRoundingMode |ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)))} is VALID [2022-02-20 16:25:20,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {254#(fp.lt (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.sub currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode |ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} assume !!~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1);main_~x~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~y~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {250#(fp.lt (fp.add currentRoundingMode (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.sub currentRoundingMode (fp.sub currentRoundingMode |ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} is VALID [2022-02-20 16:25:20,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#(fp.lt (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.sub currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode |ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} assume !!~fp.lt~FLOAT(main_~x~0#1, main_~y~0#1);main_~x~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~y~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {254#(fp.lt (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.sub currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode |ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} is VALID [2022-02-20 16:25:22,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := ~to_fp~FLOAT(currentRoundingMode, 1.0);main_~y~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E7));main_~z~0#1 := ~to_fp~FLOAT(currentRoundingMode, 42.0); {258#(fp.lt (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.sub currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode |ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} is VALID [2022-02-20 16:25:22,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {195#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {195#true} is VALID [2022-02-20 16:25:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 4 not checked. [2022-02-20 16:25:22,025 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:25:22,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987407879] [2022-02-20 16:25:22,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987407879] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:25:22,025 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:25:22,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-02-20 16:25:22,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377126193] [2022-02-20 16:25:22,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:25:22,026 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:25:22,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:25:22,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2022-02-20 16:25:24,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:25:24,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 16:25:24,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:25:24,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 16:25:24,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=79, Unknown=10, NotChecked=20, Total=156 [2022-02-20 16:25:24,443 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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)