./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1091.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1091.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 9c301aadcf824cc95473e8bc31e84ff4ca7e703d59978c831f904d5646201155 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:14,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:14,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:14,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:14,353 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:14,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:14,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:14,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:14,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:14,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:14,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:14,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:14,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:14,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:14,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:14,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:14,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:14,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:14,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:14,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:14,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:14,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:14,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:14,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:14,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:14,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:14,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:14,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:14,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:14,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:14,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:14,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:14,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:14,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:14,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:14,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:14,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:14,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:14,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:14,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:14,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:14,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:46:14,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:14,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:14,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:14,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:14,409 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:14,409 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:14,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:14,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:14,410 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:14,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:14,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:14,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:14,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:14,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:14,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:14,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:14,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:14,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:14,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:14,412 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:14,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:14,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:14,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:14,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:14,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:14,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:14,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:14,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:14,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:14,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:14,415 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:14,415 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:14,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:14,415 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 -> 9c301aadcf824cc95473e8bc31e84ff4ca7e703d59978c831f904d5646201155 [2022-02-20 16:46:14,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:14,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:14,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:14,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:14,595 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:14,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1091.c [2022-02-20 16:46:14,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3549496f4/ea71968581bf44d6bef271acec9bab6a/FLAG1b13df2a0 [2022-02-20 16:46:15,022 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:15,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1091.c [2022-02-20 16:46:15,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3549496f4/ea71968581bf44d6bef271acec9bab6a/FLAG1b13df2a0 [2022-02-20 16:46:15,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3549496f4/ea71968581bf44d6bef271acec9bab6a [2022-02-20 16:46:15,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:15,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:15,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:15,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:15,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:15,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c3051d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15, skipping insertion in model container [2022-02-20 16:46:15,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:15,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:15,217 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-newlib/float_req_bl_1091.c[1603,1616] [2022-02-20 16:46:15,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:15,231 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:15,251 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-newlib/float_req_bl_1091.c[1603,1616] [2022-02-20 16:46:15,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:15,260 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:15,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15 WrapperNode [2022-02-20 16:46:15,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:15,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:15,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:15,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:15,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,295 INFO L137 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-02-20 16:46:15,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:15,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:15,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:15,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:15,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:15,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:15,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:15,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:15,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:15,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:15,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:46:15,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:46:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:15,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:15,523 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:15,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:15,783 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:15,789 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:15,807 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:46:15,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:15 BoogieIcfgContainer [2022-02-20 16:46:15,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:15,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:15,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:15,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:15,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:15" (1/3) ... [2022-02-20 16:46:15,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea8743d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:15, skipping insertion in model container [2022-02-20 16:46:15,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (2/3) ... [2022-02-20 16:46:15,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea8743d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:15, skipping insertion in model container [2022-02-20 16:46:15,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:15" (3/3) ... [2022-02-20 16:46:15,816 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1091.c [2022-02-20 16:46:15,820 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:15,820 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:15,870 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:15,877 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:46:15,877 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:15,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:15,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:15,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2022266355, now seen corresponding path program 1 times [2022-02-20 16:46:15,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:15,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297544293] [2022-02-20 16:46:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:15,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:16,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~huge_ceil~0 := 1.0E30; {29#true} is VALID [2022-02-20 16:46:16,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~ret7#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {29#true} is VALID [2022-02-20 16:46:16,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 16:46:16,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} ceil_float_~ix~0#1 := (if 0 == ceil_float_~i0~0#1 then 0 else (if 1 == ceil_float_~i0~0#1 then 1 else ~bitwiseAnd(ceil_float_~i0~0#1, 2147483647)));ceil_float_~j0~0#1 := (if (ceil_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (ceil_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 else (ceil_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); {30#false} is VALID [2022-02-20 16:46:16,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} assume !(ceil_float_~j0~0#1 < 23); {30#false} is VALID [2022-02-20 16:46:16,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume !!(ceil_float_~ix~0#1 % 4294967296 < 2139095040);ceil_float_#res#1 := ceil_float_~x#1; {30#false} is VALID [2022-02-20 16:46:16,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} main_#t~ret6#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {30#false} is VALID [2022-02-20 16:46:16,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} main_#t~ret7#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647; {30#false} is VALID [2022-02-20 16:46:16,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume 0 == main_#t~ret7#1;havoc main_#t~ret7#1; {30#false} is VALID [2022-02-20 16:46:16,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 16:46:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:16,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:16,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297544293] [2022-02-20 16:46:16,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297544293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:16,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:16,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:16,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418041603] [2022-02-20 16:46:16,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:16,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:16,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:16,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:16,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:16,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:16,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:16,169 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,222 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-02-20 16:46:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:16,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 16:46:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 16:46:16,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2022-02-20 16:46:16,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:16,327 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:46:16,327 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:46:16,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:16,335 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:16,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:16,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:46:16,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:46:16,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:16,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,361 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,361 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,364 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-02-20 16:46:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:16,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:16,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 23 states. [2022-02-20 16:46:16,365 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 23 states. [2022-02-20 16:46:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,368 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-02-20 16:46:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:16,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:16,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:16,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-02-20 16:46:16,372 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2022-02-20 16:46:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:16,373 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-02-20 16:46:16,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:16,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:16,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:16,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:16,375 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash -62606256, now seen corresponding path program 1 times [2022-02-20 16:46:16,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:16,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548063460] [2022-02-20 16:46:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:16,438 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:16,481 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:16,481 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:16,482 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:16,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:16,485 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:16,487 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:16,515 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:16,515 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:16,515 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:46:16,515 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:46:16,515 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:16,515 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:16,515 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:16,516 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:16,517 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:16,518 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:16,518 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:16,518 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:16,518 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:46:16,518 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 16:46:16,518 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 16:46:16,518 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:16,518 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:16,518 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:16,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:16 BoogieIcfgContainer [2022-02-20 16:46:16,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:16,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:16,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:16,520 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:16,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:15" (3/4) ... [2022-02-20 16:46:16,522 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:16,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:16,523 INFO L158 Benchmark]: Toolchain (without parser) took 1479.95ms. Allocated memory is still 176.2MB. Free memory was 143.1MB in the beginning and 89.3MB in the end (delta: 53.8MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,524 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 46.5MB in the beginning and 46.4MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:16,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.41ms. Allocated memory is still 176.2MB. Free memory was 142.5MB in the beginning and 150.1MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.11ms. Allocated memory is still 176.2MB. Free memory was 150.1MB in the beginning and 147.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,529 INFO L158 Benchmark]: Boogie Preprocessor took 48.54ms. Allocated memory is still 176.2MB. Free memory was 147.9MB in the beginning and 146.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,529 INFO L158 Benchmark]: RCFGBuilder took 455.32ms. Allocated memory is still 176.2MB. Free memory was 146.0MB in the beginning and 129.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,529 INFO L158 Benchmark]: TraceAbstraction took 708.15ms. Allocated memory is still 176.2MB. Free memory was 129.2MB in the beginning and 90.0MB in the end (delta: 39.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,530 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 176.2MB. Free memory was 90.0MB in the beginning and 89.3MB in the end (delta: 708.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:16,535 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 46.5MB in the beginning and 46.4MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.41ms. Allocated memory is still 176.2MB. Free memory was 142.5MB in the beginning and 150.1MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.11ms. Allocated memory is still 176.2MB. Free memory was 150.1MB in the beginning and 147.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.54ms. Allocated memory is still 176.2MB. Free memory was 147.9MB in the beginning and 146.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 455.32ms. Allocated memory is still 176.2MB. Free memory was 146.0MB in the beginning and 129.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 708.15ms. Allocated memory is still 176.2MB. Free memory was 129.2MB in the beginning and 90.0MB in the end (delta: 39.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 176.2MB. Free memory was 90.0MB in the beginning and 89.3MB in the end (delta: 708.4kB). 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: 74]: 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 59, overapproximation of someBinaryArithmeticFLOAToperation at line 68, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L13] static const float huge_ceil = 1.0e30; VAL [huge_ceil=1000000000000000000000000000000] [L68] float x = 0.0f / 0.0f; [L70] CALL, EXPR ceil_float(x) [L16] __int32_t i0, j0; [L17] __uint32_t i, ix; VAL [\old(x)=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, x=1000000000000000000000000000001] [L19] ieee_float_shape_type gf_u; [L20] gf_u.value = (x) [L21] EXPR gf_u.word [L21] (i0) = gf_u.word [L23] ix = (i0 & 0x7fffffff) [L24] j0 = (ix >> 23) - 0x7f VAL [\old(x)=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=6, j0=2147483521, x=1000000000000000000000000000001] [L25] COND FALSE !(j0 < 23) VAL [\old(x)=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=6, j0=2147483521, x=1000000000000000000000000000001] [L45] COND FALSE !(!((ix) < 0x7f800000L)) [L48] return x; VAL [\old(x)=1000000000000000000000000000001, \result=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=6, j0=2147483521, x=1000000000000000000000000000001] [L70] RET, EXPR ceil_float(x) [L70] float res = ceil_float(x); [L73] CALL, EXPR isnan_float(res) [L59] return x != x; VAL [\old(x)=1000000000000000000000000000001, \result=0, huge_ceil=1000000000000000000000000000000, x=1000000000000000000000000000001] [L73] RET, EXPR isnan_float(res) [L73] COND TRUE !isnan_float(res) [L74] reach_error() VAL [huge_ceil=1000000000000000000000000000000, res=1000000000000000000000000000001, x=1000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:46:16,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1091.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 9c301aadcf824cc95473e8bc31e84ff4ca7e703d59978c831f904d5646201155 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:18,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:18,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:18,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:18,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:18,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:18,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:18,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:18,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:18,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:18,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:18,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:18,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:18,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:18,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:18,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:18,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:18,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:18,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:18,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:18,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:18,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:18,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:18,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:18,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:18,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:18,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:18,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:18,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:18,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:18,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:18,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:18,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:18,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:18,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:18,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:18,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:18,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:18,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:18,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:18,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:18,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:46:18,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:18,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:18,606 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:18,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:18,607 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:18,607 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:18,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:18,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:18,608 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:18,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:18,609 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:18,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:18,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:18,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:18,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:18,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:18,610 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:18,610 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:18,610 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:18,610 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:18,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:18,610 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:18,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:18,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:18,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:18,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:18,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:18,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:18,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:18,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:18,612 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:18,612 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:18,612 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:18,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:18,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:18,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:18,613 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 -> 9c301aadcf824cc95473e8bc31e84ff4ca7e703d59978c831f904d5646201155 [2022-02-20 16:46:18,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:18,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:18,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:18,900 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:18,900 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:18,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1091.c [2022-02-20 16:46:18,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c204047f8/158e62732f4e4debad4aec590dedf3da/FLAG8823f645d [2022-02-20 16:46:19,308 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:19,308 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1091.c [2022-02-20 16:46:19,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c204047f8/158e62732f4e4debad4aec590dedf3da/FLAG8823f645d [2022-02-20 16:46:19,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c204047f8/158e62732f4e4debad4aec590dedf3da [2022-02-20 16:46:19,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:19,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:19,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:19,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:19,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:19,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab97fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19, skipping insertion in model container [2022-02-20 16:46:19,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:19,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:19,892 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-newlib/float_req_bl_1091.c[1603,1616] [2022-02-20 16:46:19,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:19,904 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:19,953 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-newlib/float_req_bl_1091.c[1603,1616] [2022-02-20 16:46:19,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:19,965 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:19,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19 WrapperNode [2022-02-20 16:46:19,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:19,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:19,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:19,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:19,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:20,002 INFO L137 Inliner]: procedures = 19, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-02-20 16:46:20,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:20,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:20,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:20,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:20,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:20,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:20,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:20,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:20,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:20,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:20,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:20,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:20,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:20,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:20,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:20,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:20,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:20,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:20,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:46:20,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:46:20,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:20,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:20,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:20,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:20,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:20,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:20,143 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:20,144 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:20,540 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:20,545 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:20,545 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:46:20,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:20 BoogieIcfgContainer [2022-02-20 16:46:20,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:20,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:20,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:20,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:20,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:19" (1/3) ... [2022-02-20 16:46:20,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4c1a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:20, skipping insertion in model container [2022-02-20 16:46:20,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (2/3) ... [2022-02-20 16:46:20,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4c1a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:20, skipping insertion in model container [2022-02-20 16:46:20,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:20" (3/3) ... [2022-02-20 16:46:20,563 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1091.c [2022-02-20 16:46:20,568 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:20,569 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:20,613 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:20,620 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:46:20,620 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:20,635 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:20,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:20,636 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2022266355, now seen corresponding path program 1 times [2022-02-20 16:46:20,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:20,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440413643] [2022-02-20 16:46:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:20,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:20,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:20,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:20,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:46:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:20,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:20,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:20,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {29#true} is VALID [2022-02-20 16:46:20,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~ret7#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {29#true} is VALID [2022-02-20 16:46:20,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 16:46:20,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {30#false} is VALID [2022-02-20 16:46:20,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} assume !~bvslt32(ceil_float_~j0~0#1, 23bv32); {30#false} is VALID [2022-02-20 16:46:20,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume !!~bvult32(ceil_float_~ix~0#1, 2139095040bv32);ceil_float_#res#1 := ceil_float_~x#1; {30#false} is VALID [2022-02-20 16:46:20,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} main_#t~ret6#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {30#false} is VALID [2022-02-20 16:46:20,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} main_#t~ret7#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {30#false} is VALID [2022-02-20 16:46:20,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume 0bv32 == main_#t~ret7#1;havoc main_#t~ret7#1; {30#false} is VALID [2022-02-20 16:46:20,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 16:46:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:20,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:20,821 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:20,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440413643] [2022-02-20 16:46:20,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440413643] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:20,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:20,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:20,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508963944] [2022-02-20 16:46:20,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:20,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:20,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:20,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:20,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:20,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:20,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:20,890 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,205 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-02-20 16:46:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:21,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 16:46:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 16:46:21,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2022-02-20 16:46:21,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:21,396 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:46:21,396 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:46:21,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:21,401 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:21,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:46:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:46:21,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:21,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,419 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,420 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,422 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-02-20 16:46:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:21,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:21,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 23 states. [2022-02-20 16:46:21,423 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 23 states. [2022-02-20 16:46:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,425 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-02-20 16:46:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:21,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:21,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:21,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-02-20 16:46:21,428 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2022-02-20 16:46:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:21,428 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-02-20 16:46:21,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:21,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:21,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:21,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:21,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:21,639 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash -62606256, now seen corresponding path program 1 times [2022-02-20 16:46:21,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:21,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129163069] [2022-02-20 16:46:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:21,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:21,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:21,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:21,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:46:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:21,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:21,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:21,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {190#true} is VALID [2022-02-20 16:46:21,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~ret7#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {198#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} is VALID [2022-02-20 16:46:21,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {198#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} is VALID [2022-02-20 16:46:21,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {198#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} goto; {198#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} is VALID [2022-02-20 16:46:21,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {198#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {198#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} is VALID [2022-02-20 16:46:21,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} assume !~bvslt32(ceil_float_~j0~0#1, 23bv32); {198#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} is VALID [2022-02-20 16:46:21,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} assume !!~bvult32(ceil_float_~ix~0#1, 2139095040bv32);ceil_float_#res#1 := ceil_float_~x#1; {214#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_#res#1|))} is VALID [2022-02-20 16:46:21,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_#res#1|))} main_#t~ret6#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {218#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:21,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret7#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {222#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret7#1|)} is VALID [2022-02-20 16:46:21,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {222#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret7#1|)} assume 0bv32 == main_#t~ret7#1;havoc main_#t~ret7#1; {191#false} is VALID [2022-02-20 16:46:21,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-02-20 16:46:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:21,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:21,985 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:21,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129163069] [2022-02-20 16:46:21,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129163069] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:21,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:21,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:21,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596506672] [2022-02-20 16:46:21,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:21,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:21,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:21,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:22,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:22,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:22,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:22,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:22,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:22,007 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:22,152 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-20 16:46:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:22,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-02-20 16:46:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-02-20 16:46:22,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-02-20 16:46:22,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:22,236 INFO L225 Difference]: With dead ends: 28 [2022-02-20 16:46:22,236 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:46:22,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:22,238 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:22,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2022-02-20 16:46:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:46:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:46:22,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:22,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:22,241 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:22,241 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:22,242 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-02-20 16:46:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:46:22,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:22,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:22,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:46:22,243 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:46:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:22,244 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-02-20 16:46:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:46:22,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:22,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:22,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:22,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-02-20 16:46:22,247 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-02-20 16:46:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:22,247 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-02-20 16:46:22,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:46:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:22,248 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:22,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:22,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:22,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:22,458 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash -64453298, now seen corresponding path program 1 times [2022-02-20 16:46:22,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:22,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272278097] [2022-02-20 16:46:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:22,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:22,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:22,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:22,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:46:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:22,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:22,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:22,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {340#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:46:22,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~ret7#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {344#(and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:22,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#(and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {344#(and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:22,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {344#(and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} goto; {344#(and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:22,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {344#(and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {344#(and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:22,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#(and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvslt32(ceil_float_~j0~0#1, 23bv32); {344#(and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:22,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#(and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvult32(ceil_float_~ix~0#1, 2139095040bv32);ceil_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ceil_float_~x#1, ceil_float_~x#1); {360#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))) |ULTIMATE.start_ceil_float_#res#1|)} is VALID [2022-02-20 16:46:22,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))) |ULTIMATE.start_ceil_float_#res#1|)} main_#t~ret6#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {364#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:22,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret7#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {368#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret7#1|)} is VALID [2022-02-20 16:46:22,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret7#1|)} assume 0bv32 == main_#t~ret7#1;havoc main_#t~ret7#1; {336#false} is VALID [2022-02-20 16:46:22,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-02-20 16:46:22,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:22,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:22,723 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:22,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272278097] [2022-02-20 16:46:22,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272278097] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:22,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:22,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:22,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831140680] [2022-02-20 16:46:22,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:22,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:22,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:22,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:22,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:22,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:22,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:22,748 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:23,210 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-02-20 16:46:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-02-20 16:46:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-02-20 16:46:23,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-02-20 16:46:23,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:23,285 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:46:23,285 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:46:23,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:23,286 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:23,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 56 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 16:46:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:46:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:46:23,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:23,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,288 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,289 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:23,290 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:46:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:46:23,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:23,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:23,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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 18 states. [2022-02-20 16:46:23,290 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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 18 states. [2022-02-20 16:46:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:23,291 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:46:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:46:23,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:23,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:23,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:23,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-02-20 16:46:23,292 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-02-20 16:46:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:23,293 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-02-20 16:46:23,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:46:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:23,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:23,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:23,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:23,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:23,505 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1612289523, now seen corresponding path program 1 times [2022-02-20 16:46:23,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:23,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614236941] [2022-02-20 16:46:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:23,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:23,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:23,507 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-02-20 16:46:23,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:46:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:23,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:23,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:23,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {478#true} is VALID [2022-02-20 16:46:23,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~ret7#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {486#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} is VALID [2022-02-20 16:46:23,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {490#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:23,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {490#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {490#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:23,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {490#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {497#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_ceil_float_~j0~0#1|)))} is VALID [2022-02-20 16:46:23,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_ceil_float_~j0~0#1|)))} assume ~bvslt32(ceil_float_~j0~0#1, 23bv32); {479#false} is VALID [2022-02-20 16:46:23,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {479#false} assume ~bvslt32(ceil_float_~j0~0#1, 0bv32); {479#false} is VALID [2022-02-20 16:46:23,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {479#false} assume !~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_ceil~0, ceil_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {479#false} is VALID [2022-02-20 16:46:23,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {479#false} call ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(ceil_float_~i0~0#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, 4bv32);call ceil_float_#t~mem5#1 := read~intFLOATTYPE4(ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, 4bv32);ceil_float_~x#1 := ceil_float_#t~mem5#1;havoc ceil_float_#t~mem5#1;call ULTIMATE.dealloc(ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset);havoc ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset; {479#false} is VALID [2022-02-20 16:46:23,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {479#false} goto; {479#false} is VALID [2022-02-20 16:46:23,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {479#false} ceil_float_#res#1 := ceil_float_~x#1; {479#false} is VALID [2022-02-20 16:46:23,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {479#false} main_#t~ret6#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {479#false} is VALID [2022-02-20 16:46:23,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {479#false} main_#t~ret7#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {479#false} is VALID [2022-02-20 16:46:23,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {479#false} assume 0bv32 == main_#t~ret7#1;havoc main_#t~ret7#1; {479#false} is VALID [2022-02-20 16:46:23,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {479#false} assume !false; {479#false} is VALID [2022-02-20 16:46:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:23,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:23,750 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:23,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614236941] [2022-02-20 16:46:23,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614236941] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:23,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:23,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:23,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510377341] [2022-02-20 16:46:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:23,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:46:23,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:23,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:23,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:23,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:23,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:23,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:23,784 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:23,827 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:46:23,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:23,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:46:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-20 16:46:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-20 16:46:23,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-02-20 16:46:23,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:23,873 INFO L225 Difference]: With dead ends: 18 [2022-02-20 16:46:23,873 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:23,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:23,874 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:23,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:46:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:23,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:23,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,875 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,875 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:23,875 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:23,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:23,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:23,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:46:23,876 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:46:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:23,876 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:23,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:23,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:23,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:23,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:23,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-02-20 16:46:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:23,877 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:23,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:23,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:23,879 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:23,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:24,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:24,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:24,154 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 33) no Hoare annotation was computed. [2022-02-20 16:46:24,154 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 76) no Hoare annotation was computed. [2022-02-20 16:46:24,154 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L861 garLoopResultBuilder]: At program point L78(lines 61 79) the Hoare annotation is: true [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 48) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 49) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L50-1(lines 15 56) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 32) no Hoare annotation was computed. [2022-02-20 16:46:24,155 INFO L854 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|) [2022-02-20 16:46:24,155 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 43) no Hoare annotation was computed. [2022-02-20 16:46:24,156 INFO L854 garLoopResultBuilder]: At program point L55(lines 15 56) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_#res#1|)) [2022-02-20 16:46:24,156 INFO L858 garLoopResultBuilder]: For program point L18-1(lines 18 22) no Hoare annotation was computed. [2022-02-20 16:46:24,156 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 18 22) the Hoare annotation is: (and (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:24,156 INFO L858 garLoopResultBuilder]: For program point L18-3(lines 18 22) no Hoare annotation was computed. [2022-02-20 16:46:24,156 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:24,156 INFO L858 garLoopResultBuilder]: For program point L39-2(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:24,158 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:46:24,158 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:24,163 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:24,163 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:24,163 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:24,163 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:24,163 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:24,163 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:24,163 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:24,163 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:24,163 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:24,164 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:24,164 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:24,164 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:24,164 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:24,164 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:24,164 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:24,164 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:24,164 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:24,166 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:24,167 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:24,168 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:24,168 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:24,168 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:24,168 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:24,168 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:46:24,169 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 16:46:24,169 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 16:46:24,169 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:24,169 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:24,169 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:24,174 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:24,175 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:24,176 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:24,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:24,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:24 BoogieIcfgContainer [2022-02-20 16:46:24,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:24,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:24,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:24,179 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:24,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:20" (3/4) ... [2022-02-20 16:46:24,187 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:24,207 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:46:24,207 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:46:24,207 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:24,208 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:24,247 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == \result) [2022-02-20 16:46:24,248 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1bv32 == \result [2022-02-20 16:46:24,262 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:24,262 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:24,263 INFO L158 Benchmark]: Toolchain (without parser) took 4512.67ms. Allocated memory was 50.3MB in the beginning and 73.4MB in the end (delta: 23.1MB). Free memory was 27.5MB in the beginning and 31.4MB in the end (delta: -4.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,263 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory is still 32.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:24,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.73ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 27.3MB in the beginning and 43.6MB in the end (delta: -16.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.39ms. Allocated memory is still 60.8MB. Free memory was 43.4MB in the beginning and 41.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,264 INFO L158 Benchmark]: Boogie Preprocessor took 22.79ms. Allocated memory is still 60.8MB. Free memory was 41.5MB in the beginning and 39.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:24,264 INFO L158 Benchmark]: RCFGBuilder took 519.00ms. Allocated memory is still 60.8MB. Free memory was 39.9MB in the beginning and 27.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,265 INFO L158 Benchmark]: TraceAbstraction took 3624.13ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 27.2MB in the beginning and 34.6MB in the end (delta: -7.4MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,265 INFO L158 Benchmark]: Witness Printer took 83.40ms. Allocated memory is still 73.4MB. Free memory was 34.6MB in the beginning and 31.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,266 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory is still 32.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.73ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 27.3MB in the beginning and 43.6MB in the end (delta: -16.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.39ms. Allocated memory is still 60.8MB. Free memory was 43.4MB in the beginning and 41.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.79ms. Allocated memory is still 60.8MB. Free memory was 41.5MB in the beginning and 39.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 519.00ms. Allocated memory is still 60.8MB. Free memory was 39.9MB in the beginning and 27.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3624.13ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 27.2MB in the beginning and 34.6MB in the end (delta: -7.4MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 83.40ms. Allocated memory is still 73.4MB. Free memory was 34.6MB in the beginning and 31.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * 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 - PositiveResult [Line: 74]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 71 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 10 NumberOfFragments, 21 HoareAnnotationTreeSize, 4 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 10 QuantifiedInterpolants, 197 SizeOfPredicates, 26 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 18]: Loop Invariant [2022-02-20 16:46:24,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:24,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant [2022-02-20 16:46:24,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:24,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == \result) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:24,324 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 Writing output log to file Ultimate.log Result: TRUE