./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/interpolation2.c.p+cfa-reducer.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 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:12:31,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:12:31,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:12:31,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:12:31,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:12:31,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:12:31,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:12:31,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:12:31,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:12:31,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:12:31,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:12:31,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:12:31,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:12:31,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:12:31,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:12:32,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:12:32,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:12:32,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:12:32,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:12:32,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:12:32,008 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:12:32,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:12:32,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:12:32,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:12:32,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:12:32,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:12:32,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:12:32,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:12:32,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:12:32,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:12:32,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:12:32,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:12:32,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:12:32,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:12:32,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:12:32,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:12:32,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:12:32,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:12:32,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:12:32,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:12:32,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:12:32,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:12:32,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 14:12:32,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:12:32,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:12:32,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:12:32,048 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:12:32,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:12:32,049 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:12:32,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:12:32,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:12:32,050 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:12:32,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:12:32,051 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:12:32,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:12:32,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:12:32,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:12:32,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:12:32,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:12:32,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:12:32,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:12:32,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:12:32,052 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:12:32,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:12:32,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:12:32,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:12:32,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:12:32,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:12:32,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:12:32,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:12:32,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:12:32,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:12:32,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:12:32,054 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:12:32,054 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:12:32,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:12:32,054 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 -> 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 [2022-07-13 14:12:32,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:12:32,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:12:32,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:12:32,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:12:32,264 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:12:32,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2022-07-13 14:12:32,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e248ddb2d/513f28a65df04926abc5ea2ac3bcfc15/FLAGfd0947bd4 [2022-07-13 14:12:32,638 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:12:32,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2022-07-13 14:12:32,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e248ddb2d/513f28a65df04926abc5ea2ac3bcfc15/FLAGfd0947bd4 [2022-07-13 14:12:33,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e248ddb2d/513f28a65df04926abc5ea2ac3bcfc15 [2022-07-13 14:12:33,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:12:33,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:12:33,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:12:33,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:12:33,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:12:33,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1769ebe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33, skipping insertion in model container [2022-07-13 14:12:33,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:12:33,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:12:33,202 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/interpolation2.c.p+cfa-reducer.c[1455,1468] [2022-07-13 14:12:33,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:12:33,209 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:12:33,230 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/interpolation2.c.p+cfa-reducer.c[1455,1468] [2022-07-13 14:12:33,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:12:33,253 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:12:33,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33 WrapperNode [2022-07-13 14:12:33,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:12:33,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:12:33,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:12:33,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:12:33,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,276 INFO L137 Inliner]: procedures = 18, calls = 55, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 131 [2022-07-13 14:12:33,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:12:33,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:12:33,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:12:33,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:12:33,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:12:33,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:12:33,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:12:33,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:12:33,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (1/1) ... [2022-07-13 14:12:33,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:12:33,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:12:33,319 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-07-13 14:12:33,321 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-07-13 14:12:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:12:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:12:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:12:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 14:12:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:12:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:12:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-13 14:12:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:12:33,403 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:12:33,404 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:12:33,550 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:12:33,554 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:12:33,555 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 14:12:33,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:12:33 BoogieIcfgContainer [2022-07-13 14:12:33,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:12:33,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:12:33,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:12:33,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:12:33,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:12:33" (1/3) ... [2022-07-13 14:12:33,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ecf538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:12:33, skipping insertion in model container [2022-07-13 14:12:33,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:33" (2/3) ... [2022-07-13 14:12:33,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ecf538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:12:33, skipping insertion in model container [2022-07-13 14:12:33,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:12:33" (3/3) ... [2022-07-13 14:12:33,562 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.p+cfa-reducer.c [2022-07-13 14:12:33,571 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:12:33,571 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:12:33,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:12:33,604 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@455ceb0d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@751dab7 [2022-07-13 14:12:33,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:12:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:12:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 14:12:33,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:12:33,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:12:33,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:12:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:12:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2022-07-13 14:12:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:12:33,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295467325] [2022-07-13 14:12:33,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:12:33,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:12:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:12:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:12:33,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:12:33,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295467325] [2022-07-13 14:12:33,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295467325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:12:33,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:12:33,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:12:33,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697607039] [2022-07-13 14:12:33,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:12:33,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:12:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:12:33,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:12:33,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:12:33,852 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:12:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:12:33,929 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-07-13 14:12:33,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 14:12:33,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-13 14:12:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:12:33,937 INFO L225 Difference]: With dead ends: 51 [2022-07-13 14:12:33,937 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 14:12:33,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 14:12:33,945 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:12:33,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:12:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 14:12:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2022-07-13 14:12:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:12:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-07-13 14:12:33,970 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 12 [2022-07-13 14:12:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:12:33,970 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-13 14:12:33,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:12:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-07-13 14:12:33,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 14:12:33,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:12:33,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:12:33,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:12:33,972 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:12:33,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:12:33,974 INFO L85 PathProgramCache]: Analyzing trace with hash 100932019, now seen corresponding path program 1 times [2022-07-13 14:12:33,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:12:33,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911487355] [2022-07-13 14:12:33,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:12:33,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:12:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:12:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:12:34,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:12:34,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911487355] [2022-07-13 14:12:34,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911487355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:12:34,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:12:34,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 14:12:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786143412] [2022-07-13 14:12:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:12:34,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 14:12:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:12:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 14:12:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:12:34,042 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:12:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:12:34,055 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-07-13 14:12:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 14:12:34,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-13 14:12:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:12:34,057 INFO L225 Difference]: With dead ends: 34 [2022-07-13 14:12:34,058 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 14:12:34,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:12:34,061 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:12:34,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 33 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:12:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 14:12:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2022-07-13 14:12:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-07-13 14:12:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-07-13 14:12:34,068 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 12 [2022-07-13 14:12:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:12:34,069 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-13 14:12:34,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:12:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-07-13 14:12:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 14:12:34,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:12:34,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:12:34,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 14:12:34,073 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:12:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:12:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2022-07-13 14:12:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:12:34,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360854603] [2022-07-13 14:12:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:12:34,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:12:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:12:34,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 14:12:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:12:34,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 14:12:34,150 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 14:12:34,151 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:12:34,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 14:12:34,155 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-13 14:12:34,158 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:12:34,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:12:34 BoogieIcfgContainer [2022-07-13 14:12:34,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:12:34,196 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:12:34,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:12:34,196 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:12:34,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:12:33" (3/4) ... [2022-07-13 14:12:34,198 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 14:12:34,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:12:34,198 INFO L158 Benchmark]: Toolchain (without parser) took 1124.81ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 55.4MB in the beginning and 93.9MB in the end (delta: -38.5MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-07-13 14:12:34,198 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 86.0MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:12:34,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.30ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 55.2MB in the beginning and 109.2MB in the end (delta: -54.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 14:12:34,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.54ms. Allocated memory is still 134.2MB. Free memory was 109.2MB in the beginning and 107.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:12:34,199 INFO L158 Benchmark]: Boogie Preprocessor took 14.49ms. Allocated memory is still 134.2MB. Free memory was 107.2MB in the beginning and 106.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:12:34,199 INFO L158 Benchmark]: RCFGBuilder took 264.29ms. Allocated memory is still 134.2MB. Free memory was 106.0MB in the beginning and 94.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 14:12:34,199 INFO L158 Benchmark]: TraceAbstraction took 637.83ms. Allocated memory is still 134.2MB. Free memory was 93.6MB in the beginning and 93.9MB in the end (delta: -284.8kB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2022-07-13 14:12:34,200 INFO L158 Benchmark]: Witness Printer took 2.11ms. Allocated memory is still 134.2MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:12:34,201 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 86.0MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.30ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 55.2MB in the beginning and 109.2MB in the end (delta: -54.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.54ms. Allocated memory is still 134.2MB. Free memory was 109.2MB in the beginning and 107.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.49ms. Allocated memory is still 134.2MB. Free memory was 107.2MB in the beginning and 106.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 264.29ms. Allocated memory is still 134.2MB. Free memory was 106.0MB in the beginning and 94.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 637.83ms. Allocated memory is still 134.2MB. Free memory was 93.6MB in the beginning and 93.9MB in the end (delta: -284.8kB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * Witness Printer took 2.11ms. Allocated memory is still 134.2MB. Free memory is still 93.9MB. 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: 53]: 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 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] main__t = __VERIFIER_nondet_float() [L22] int main____CPAchecker_TMP_0; [L23] EXPR main__min[0] VAL [__return_main=0, main__max={6:0}, main__min={7:0}, main__min[0]=49, main__org={4:0}, main__slope={5:0}] [L23] COND TRUE main__t >= (main__min[0]) [L25] EXPR main__max[4UL] VAL [__return_main=0, main__max={6:0}, main__max[4UL]=51, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L25] COND TRUE main__t <= (main__max[4UL]) [L27] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L33] COND TRUE main__i < 5UL [L35] EXPR main__max[main__i] VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__max[main__i]=50, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L35] COND TRUE main__t <= (main__max[main__i]) [L38] EXPR main__org[main__i] [L38] EXPR main__slope[main__i] [L38] EXPR main__min[main__i] [L38] EXPR main__max[main__i] [L38] EXPR main__min[main__i] [L38] main__z = (main__org[main__i]) + (((main__slope[main__i]) * (main__t - (main__min[main__i]))) / ((main__max[main__i]) - (main__min[main__i]))) [L39] int main____CPAchecker_TMP_1; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L65] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_1 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L53] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 42 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 14:12:34,228 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 -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/interpolation2.c.p+cfa-reducer.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 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:12:35,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:12:35,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:12:35,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:12:35,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:12:35,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:12:35,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:12:35,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:12:35,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:12:35,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:12:35,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:12:35,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:12:35,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:12:35,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:12:35,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:12:35,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:12:35,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:12:35,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:12:35,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:12:35,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:12:35,727 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:12:35,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:12:35,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:12:35,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:12:35,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:12:35,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:12:35,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:12:35,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:12:35,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:12:35,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:12:35,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:12:35,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:12:35,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:12:35,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:12:35,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:12:35,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:12:35,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:12:35,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:12:35,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:12:35,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:12:35,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:12:35,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:12:35,749 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 14:12:35,780 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:12:35,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:12:35,780 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:12:35,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:12:35,781 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:12:35,781 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:12:35,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:12:35,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:12:35,782 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:12:35,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:12:35,783 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:12:35,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:12:35,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:12:35,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:12:35,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:12:35,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:12:35,784 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 14:12:35,784 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 14:12:35,784 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 14:12:35,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:12:35,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:12:35,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:12:35,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:12:35,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:12:35,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:12:35,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:12:35,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:12:35,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:12:35,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:12:35,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:12:35,786 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 14:12:35,786 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 14:12:35,786 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:12:35,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:12:35,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:12:35,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 14:12:35,787 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 -> 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 [2022-07-13 14:12:36,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:12:36,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:12:36,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:12:36,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:12:36,023 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:12:36,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2022-07-13 14:12:36,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a5099bf/b16a5d0aab1746388bd5182068141baf/FLAGfb349facd [2022-07-13 14:12:36,433 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:12:36,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2022-07-13 14:12:36,438 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a5099bf/b16a5d0aab1746388bd5182068141baf/FLAGfb349facd [2022-07-13 14:12:36,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a5099bf/b16a5d0aab1746388bd5182068141baf [2022-07-13 14:12:36,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:12:36,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:12:36,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:12:36,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:12:36,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:12:36,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:12:36" (1/1) ... [2022-07-13 14:12:36,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e65101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:36, skipping insertion in model container [2022-07-13 14:12:36,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:12:36" (1/1) ... [2022-07-13 14:12:36,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:12:36,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:12:36,956 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/interpolation2.c.p+cfa-reducer.c[1455,1468] [2022-07-13 14:12:36,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:12:36,965 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:12:37,019 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/interpolation2.c.p+cfa-reducer.c[1455,1468] [2022-07-13 14:12:37,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:12:37,037 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:12:37,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37 WrapperNode [2022-07-13 14:12:37,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:12:37,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:12:37,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:12:37,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:12:37,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (1/1) ... [2022-07-13 14:12:37,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (1/1) ... [2022-07-13 14:12:37,073 INFO L137 Inliner]: procedures = 19, calls = 55, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2022-07-13 14:12:37,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:12:37,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:12:37,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:12:37,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:12:37,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (1/1) ... [2022-07-13 14:12:37,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (1/1) ... [2022-07-13 14:12:37,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (1/1) ... [2022-07-13 14:12:37,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (1/1) ... [2022-07-13 14:12:37,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (1/1) ... [2022-07-13 14:12:37,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (1/1) ... [2022-07-13 14:12:37,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (1/1) ... [2022-07-13 14:12:37,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:12:37,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:12:37,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:12:37,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:12:37,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (1/1) ... [2022-07-13 14:12:37,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:12:37,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:12:37,144 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-07-13 14:12:37,162 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-07-13 14:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-07-13 14:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 14:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-13 14:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:12:37,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:12:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:12:37,252 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:12:37,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:12:39,671 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:12:39,675 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:12:39,675 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 14:12:39,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:12:39 BoogieIcfgContainer [2022-07-13 14:12:39,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:12:39,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:12:39,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:12:39,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:12:39,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:12:36" (1/3) ... [2022-07-13 14:12:39,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffec85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:12:39, skipping insertion in model container [2022-07-13 14:12:39,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:12:37" (2/3) ... [2022-07-13 14:12:39,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffec85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:12:39, skipping insertion in model container [2022-07-13 14:12:39,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:12:39" (3/3) ... [2022-07-13 14:12:39,681 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.p+cfa-reducer.c [2022-07-13 14:12:39,690 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:12:39,690 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:12:39,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:12:39,721 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50512ed3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@fc41d71 [2022-07-13 14:12:39,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:12:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:12:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 14:12:39,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:12:39,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:12:39,736 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:12:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:12:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2022-07-13 14:12:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:12:39,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540873817] [2022-07-13 14:12:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:12:39,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:12:39,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:12:39,755 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-07-13 14:12:39,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 14:12:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:12:40,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 14:12:40,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:12:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:12:40,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:12:40,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:12:40,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540873817] [2022-07-13 14:12:40,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540873817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:12:40,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:12:40,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 14:12:40,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231963592] [2022-07-13 14:12:40,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:12:40,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 14:12:40,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:12:40,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 14:12:40,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:12:40,118 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:12:42,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:12:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:12:42,413 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-13 14:12:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 14:12:42,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-13 14:12:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:12:42,420 INFO L225 Difference]: With dead ends: 33 [2022-07-13 14:12:42,420 INFO L226 Difference]: Without dead ends: 19 [2022-07-13 14:12:42,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-07-13 14:12:42,424 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 14:12:42,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 14:12:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-13 14:12:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-07-13 14:12:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:12:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-07-13 14:12:42,442 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2022-07-13 14:12:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:12:42,443 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-07-13 14:12:42,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:12:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-07-13 14:12:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 14:12:42,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:12:42,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:12:42,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 14:12:42,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:12:42,657 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:12:42,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:12:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2022-07-13 14:12:42,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:12:42,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980785385] [2022-07-13 14:12:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:12:42,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:12:42,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:12:42,660 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-07-13 14:12:42,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 14:12:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:12:42,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 14:12:42,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:12:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:12:43,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:12:43,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:12:43,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980785385] [2022-07-13 14:12:43,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980785385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:12:43,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:12:43,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:12:43,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976645608] [2022-07-13 14:12:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:12:43,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:12:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:12:43,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:12:43,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:12:43,013 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-07-13 14:12:45,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:12:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:12:45,329 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-07-13 14:12:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:12:45,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 14:12:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:12:45,331 INFO L225 Difference]: With dead ends: 21 [2022-07-13 14:12:45,331 INFO L226 Difference]: Without dead ends: 17 [2022-07-13 14:12:45,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:12:45,332 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 14:12:45,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 14:12:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-13 14:12:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 14:12:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-07-13 14:12:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-07-13 14:12:45,335 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2022-07-13 14:12:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:12:45,335 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-13 14:12:45,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-07-13 14:12:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-07-13 14:12:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 14:12:45,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:12:45,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:12:45,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-13 14:12:45,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:12:45,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:12:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:12:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2022-07-13 14:12:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:12:45,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208346856] [2022-07-13 14:12:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:12:45,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:12:45,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:12:45,539 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-07-13 14:12:45,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 14:12:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:12:45,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 14:12:46,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:12:51,383 INFO L356 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2022-07-13 14:12:51,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 146 [2022-07-13 14:13:53,174 WARN L233 SmtUtils]: Spent 21.79s on a formula simplification. DAG size of input: 57 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 14:14:23,687 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)))))) is different from false [2022-07-13 14:14:25,718 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)))))) is different from true [2022-07-13 14:15:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:15:44,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:15:44,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:15:44,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208346856] [2022-07-13 14:15:44,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208346856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:15:44,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:15:44,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 14:15:44,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660663249] [2022-07-13 14:15:44,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:15:44,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 14:15:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:15:44,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 14:15:44,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=56, Unknown=7, NotChecked=16, Total=110 [2022-07-13 14:15:44,053 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 11 states, 10 states have (on average 1.3) 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-07-13 14:15:46,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:15:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:15:46,947 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-07-13 14:15:46,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 14:15:46,954 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) 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) Word has length 13 [2022-07-13 14:15:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:15:46,954 INFO L225 Difference]: With dead ends: 30 [2022-07-13 14:15:46,954 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 14:15:46,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=31, Invalid=56, Unknown=7, NotChecked=16, Total=110 [2022-07-13 14:15:46,955 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-13 14:15:46,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 26 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 1 Unknown, 37 Unchecked, 2.9s Time] [2022-07-13 14:15:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 14:15:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-07-13 14:15:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:15:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-07-13 14:15:46,959 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2022-07-13 14:15:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:15:46,960 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-13 14:15:46,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) 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-07-13 14:15:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-07-13 14:15:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 14:15:46,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:15:46,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:15:46,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 14:15:47,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:15:47,168 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:15:47,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:15:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2022-07-13 14:15:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:15:47,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156864730] [2022-07-13 14:15:47,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:15:47,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:15:47,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:15:47,170 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:15:47,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 14:15:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:15:47,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 14:15:47,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:15:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:15:47,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:15:47,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:15:47,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156864730] [2022-07-13 14:15:47,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156864730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:15:47,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:15:47,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 14:15:47,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82384607] [2022-07-13 14:15:47,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:15:47,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 14:15:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:15:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 14:15:47,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:15:47,474 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:15:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:15:47,505 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-07-13 14:15:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 14:15:47,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 14:15:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:15:47,506 INFO L225 Difference]: With dead ends: 32 [2022-07-13 14:15:47,506 INFO L226 Difference]: Without dead ends: 19 [2022-07-13 14:15:47,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-07-13 14:15:47,507 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:15:47,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:15:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-13 14:15:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 14:15:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:15:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-13 14:15:47,510 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-07-13 14:15:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:15:47,510 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-13 14:15:47,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:15:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-07-13 14:15:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 14:15:47,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:15:47,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:15:47,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 14:15:47,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:15:47,712 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:15:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:15:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2022-07-13 14:15:47,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:15:47,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534583415] [2022-07-13 14:15:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:15:47,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:15:47,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:15:47,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:15:47,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 14:15:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:15:48,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 14:15:48,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:15:52,731 INFO L356 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2022-07-13 14:15:52,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 146 [2022-07-13 14:16:12,777 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse3) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-13 14:16:40,980 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse3) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-13 14:17:16,462 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse4))))) is different from false [2022-07-13 14:17:18,506 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse4))))) is different from true