./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1092c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1092c.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 17022ac2d6c28ca56f87370a650921d1e6855c5509a626b4c9b141cb3850c9a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:24:53,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:24:53,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:24:53,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:24:53,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:24:53,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:24:53,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:24:53,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:24:53,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:24:53,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:24:53,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:24:53,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:24:53,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:24:53,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:24:53,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:24:53,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:24:53,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:24:53,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:24:53,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:24:53,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:24:53,437 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:24:53,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:24:53,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:24:53,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:24:53,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:24:53,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:24:53,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:24:53,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:24:53,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:24:53,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:24:53,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:24:53,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:24:53,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:24:53,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:24:53,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:24:53,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:24:53,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:24:53,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:24:53,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:24:53,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:24:53,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:24:53,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:24:53,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:24:53,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:24:53,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:24:53,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:24:53,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:24:53,491 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:24:53,491 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:24:53,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:24:53,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:24:53,492 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:24:53,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:24:53,492 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:24:53,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:24:53,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:24:53,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:24:53,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:24:53,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:24:53,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:24:53,493 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:24:53,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:24:53,493 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:24:53,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:24:53,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:24:53,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:24:53,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:24:53,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:24:53,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:24:53,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:24:53,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:24:53,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:24:53,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:24:53,494 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:24:53,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:24:53,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:24:53,494 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 -> 17022ac2d6c28ca56f87370a650921d1e6855c5509a626b4c9b141cb3850c9a7 [2022-07-22 14:24:53,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:24:53,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:24:53,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:24:53,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:24:53,734 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:24:53,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1092c.c [2022-07-22 14:24:53,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc55501b/28db37c5cbb147da94bf9df5bdb3bd97/FLAGbb01a2a42 [2022-07-22 14:24:54,204 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:24:54,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092c.c [2022-07-22 14:24:54,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc55501b/28db37c5cbb147da94bf9df5bdb3bd97/FLAGbb01a2a42 [2022-07-22 14:24:54,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc55501b/28db37c5cbb147da94bf9df5bdb3bd97 [2022-07-22 14:24:54,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:24:54,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:24:54,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:24:54,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:24:54,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:24:54,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1296712f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54, skipping insertion in model container [2022-07-22 14:24:54,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:24:54,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:24:54,800 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/double_req_bl_1092c.c[2414,2427] [2022-07-22 14:24:54,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:24:54,809 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:24:54,834 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/double_req_bl_1092c.c[2414,2427] [2022-07-22 14:24:54,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:24:54,850 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:24:54,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54 WrapperNode [2022-07-22 14:24:54,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:24:54,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:24:54,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:24:54,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:24:54,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,916 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-07-22 14:24:54,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:24:54,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:24:54,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:24:54,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:24:54,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:24:54,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:24:54,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:24:54,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:24:54,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (1/1) ... [2022-07-22 14:24:54,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:24:54,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:24:55,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:24:55,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:24:55,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:24:55,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:24:55,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:24:55,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-22 14:24:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:24:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-22 14:24:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:24:55,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:24:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:24:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:24:55,124 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:24:55,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:24:55,432 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:24:55,438 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:24:55,438 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 14:24:55,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:24:55 BoogieIcfgContainer [2022-07-22 14:24:55,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:24:55,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:24:55,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:24:55,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:24:55,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:24:54" (1/3) ... [2022-07-22 14:24:55,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b163e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:24:55, skipping insertion in model container [2022-07-22 14:24:55,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:54" (2/3) ... [2022-07-22 14:24:55,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b163e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:24:55, skipping insertion in model container [2022-07-22 14:24:55,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:24:55" (3/3) ... [2022-07-22 14:24:55,457 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092c.c [2022-07-22 14:24:55,473 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:24:55,474 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:24:55,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:24:55,535 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e9e69c7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1da10fef [2022-07-22 14:24:55,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:24:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:24:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 14:24:55,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:24:55,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:24:55,547 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:24:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:24:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash 658478814, now seen corresponding path program 1 times [2022-07-22 14:24:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:24:55,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331841899] [2022-07-22 14:24:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:24:55,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:24:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:24:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:24:55,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:24:55,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331841899] [2022-07-22 14:24:55,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331841899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:24:55,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:24:55,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:24:55,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744615913] [2022-07-22 14:24:55,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:24:55,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:24:55,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:24:55,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:24:55,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:24:55,737 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:24:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:24:55,752 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2022-07-22 14:24:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:24:55,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 14:24:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:24:55,772 INFO L225 Difference]: With dead ends: 72 [2022-07-22 14:24:55,773 INFO L226 Difference]: Without dead ends: 34 [2022-07-22 14:24:55,776 INFO L412 NwaCegarLoop]: 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-07-22 14:24:55,781 INFO L413 NwaCegarLoop]: 51 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, 51 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-07-22 14:24:55,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:24:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-22 14:24:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-22 14:24:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:24:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-07-22 14:24:55,811 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 13 [2022-07-22 14:24:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:24:55,812 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-07-22 14:24:55,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:24:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-07-22 14:24:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 14:24:55,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:24:55,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:24:55,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:24:55,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:24:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:24:55,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1562173395, now seen corresponding path program 1 times [2022-07-22 14:24:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:24:55,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502908409] [2022-07-22 14:24:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:24:55,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:24:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 14:24:56,302 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 14:24:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 14:24:56,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 14:24:56,515 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 14:24:56,516 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 14:24:56,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:24:56,521 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-22 14:24:56,524 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 14:24:56,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 02:24:56 BoogieIcfgContainer [2022-07-22 14:24:56,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 14:24:56,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 14:24:56,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 14:24:56,549 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 14:24:56,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:24:55" (3/4) ... [2022-07-22 14:24:56,552 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 14:24:56,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 14:24:56,554 INFO L158 Benchmark]: Toolchain (without parser) took 1939.05ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 64.5MB in the beginning and 73.5MB in the end (delta: -9.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2022-07-22 14:24:56,554 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 98.6MB. Free memory was 53.2MB in the beginning and 53.1MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:24:56,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.78ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 64.3MB in the beginning and 96.9MB in the end (delta: -32.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 14:24:56,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.98ms. Allocated memory is still 123.7MB. Free memory was 96.9MB in the beginning and 93.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 14:24:56,556 INFO L158 Benchmark]: Boogie Preprocessor took 61.46ms. Allocated memory is still 123.7MB. Free memory was 93.2MB in the beginning and 90.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:24:56,556 INFO L158 Benchmark]: RCFGBuilder took 459.82ms. Allocated memory is still 123.7MB. Free memory was 90.2MB in the beginning and 67.6MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-22 14:24:56,557 INFO L158 Benchmark]: TraceAbstraction took 1107.30ms. Allocated memory is still 123.7MB. Free memory was 67.2MB in the beginning and 74.1MB in the end (delta: -6.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2022-07-22 14:24:56,557 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 123.7MB. Free memory was 74.1MB in the beginning and 73.5MB in the end (delta: 570.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:24:56,559 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 98.6MB. Free memory was 53.2MB in the beginning and 53.1MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.78ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 64.3MB in the beginning and 96.9MB in the end (delta: -32.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.98ms. Allocated memory is still 123.7MB. Free memory was 96.9MB in the beginning and 93.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.46ms. Allocated memory is still 123.7MB. Free memory was 93.2MB in the beginning and 90.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.82ms. Allocated memory is still 123.7MB. Free memory was 90.2MB in the beginning and 67.6MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1107.30ms. Allocated memory is still 123.7MB. Free memory was 67.2MB in the beginning and 74.1MB in the end (delta: -6.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 123.7MB. Free memory was 74.1MB in the beginning and 73.5MB in the end (delta: 570.1kB). 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: 109]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftRight at line 40, overapproximation of bitwiseOr at line 92, overapproximation of someBinaryArithmeticDOUBLEoperation at line 105, overapproximation of bitwiseAnd at line 91. Possible FailurePath: [L16] static const double huge_ceil = 1.0e300; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L105] double x = 1.0 / 0.0; [L106] CALL, EXPR ceil_double(x) [L19] __int32_t i0, i1, j0; [L20] __uint32_t i, j; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (i0) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (i1) = ew_u.parts.lsw [L27] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=8388606, i1=-1, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L28] COND TRUE j0 < 20 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=8388606, i1=-1, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L29] COND FALSE !(j0 < 0) [L40] i = (0x000fffff) >> j0 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=0, i0=8388606, i1=-1, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L41] COND TRUE ((i0 & i) | i1) == 0 [L42] return x; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \result=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=0, i0=8388606, i1=-1, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L106] RET, EXPR ceil_double(x) [L106] double res = ceil_double(x); [L108] CALL, EXPR isinf_double(res) [L84] __int32_t hx, lx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L86] ieee_double_shape_type ew_u; [L87] ew_u.value = (x) [L88] EXPR ew_u.parts.msw [L88] (hx) = ew_u.parts.msw [L89] EXPR ew_u.parts.lsw [L89] (lx) = ew_u.parts.lsw [L91] hx &= 0x7fffffff [L92] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L93] hx = 0x7ff00000 - hx [L94] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \result=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=1, lx=-2, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L108] RET, EXPR isinf_double(res) [L108] COND TRUE !isinf_double(res) [L109] reach_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 51 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, 51 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=37occurred 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.5s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 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-07-22 14:24:56,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1092c.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 17022ac2d6c28ca56f87370a650921d1e6855c5509a626b4c9b141cb3850c9a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:24:58,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:24:58,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:24:58,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:24:58,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:24:58,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:24:58,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:24:58,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:24:58,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:24:58,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:24:58,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:24:58,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:24:58,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:24:58,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:24:58,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:24:58,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:24:58,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:24:58,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:24:58,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:24:58,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:24:58,640 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:24:58,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:24:58,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:24:58,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:24:58,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:24:58,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:24:58,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:24:58,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:24:58,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:24:58,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:24:58,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:24:58,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:24:58,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:24:58,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:24:58,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:24:58,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:24:58,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:24:58,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:24:58,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:24:58,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:24:58,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:24:58,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:24:58,670 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 14:24:58,701 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:24:58,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:24:58,702 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:24:58,703 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:24:58,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:24:58,703 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:24:58,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:24:58,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:24:58,705 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:24:58,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:24:58,706 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:24:58,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:24:58,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:24:58,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:24:58,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:24:58,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:24:58,707 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:24:58,707 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:24:58,707 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:24:58,707 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:24:58,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:24:58,708 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:24:58,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:24:58,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:24:58,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:24:58,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:24:58,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:24:58,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:24:58,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:24:58,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:24:58,710 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:24:58,710 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:24:58,710 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:24:58,710 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:24:58,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:24:58,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:24:58,711 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 -> 17022ac2d6c28ca56f87370a650921d1e6855c5509a626b4c9b141cb3850c9a7 [2022-07-22 14:24:59,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:24:59,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:24:59,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:24:59,076 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:24:59,076 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:24:59,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1092c.c [2022-07-22 14:24:59,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200033a8a/2c614fa871eb4cf686ec165826f2ad84/FLAG5603374c9 [2022-07-22 14:24:59,579 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:24:59,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092c.c [2022-07-22 14:24:59,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200033a8a/2c614fa871eb4cf686ec165826f2ad84/FLAG5603374c9 [2022-07-22 14:24:59,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200033a8a/2c614fa871eb4cf686ec165826f2ad84 [2022-07-22 14:24:59,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:24:59,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:24:59,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:24:59,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:24:59,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:24:59,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:24:59" (1/1) ... [2022-07-22 14:24:59,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54acc4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:24:59, skipping insertion in model container [2022-07-22 14:24:59,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:24:59" (1/1) ... [2022-07-22 14:24:59,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:24:59,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:25:00,141 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/double_req_bl_1092c.c[2414,2427] [2022-07-22 14:25:00,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:25:00,156 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:25:00,232 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/double_req_bl_1092c.c[2414,2427] [2022-07-22 14:25:00,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:25:00,258 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:25:00,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00 WrapperNode [2022-07-22 14:25:00,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:25:00,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:25:00,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:25:00,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:25:00,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (1/1) ... [2022-07-22 14:25:00,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (1/1) ... [2022-07-22 14:25:00,311 INFO L137 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-07-22 14:25:00,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:25:00,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:25:00,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:25:00,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:25:00,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (1/1) ... [2022-07-22 14:25:00,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (1/1) ... [2022-07-22 14:25:00,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (1/1) ... [2022-07-22 14:25:00,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (1/1) ... [2022-07-22 14:25:00,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (1/1) ... [2022-07-22 14:25:00,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (1/1) ... [2022-07-22 14:25:00,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (1/1) ... [2022-07-22 14:25:00,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:25:00,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:25:00,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:25:00,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:25:00,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (1/1) ... [2022-07-22 14:25:00,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:25:00,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:25:00,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:25:00,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:25:00,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:25:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-22 14:25:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-22 14:25:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:25:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:25:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 14:25:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:25:00,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:25:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 14:25:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:25:00,546 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:25:00,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:25:01,964 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:25:01,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:25:01,970 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 14:25:01,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:25:01 BoogieIcfgContainer [2022-07-22 14:25:01,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:25:01,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:25:01,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:25:01,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:25:01,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:24:59" (1/3) ... [2022-07-22 14:25:01,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35192639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:25:01, skipping insertion in model container [2022-07-22 14:25:01,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:25:00" (2/3) ... [2022-07-22 14:25:01,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35192639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:25:01, skipping insertion in model container [2022-07-22 14:25:01,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:25:01" (3/3) ... [2022-07-22 14:25:01,980 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092c.c [2022-07-22 14:25:01,995 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:25:01,996 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:25:02,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:25:02,045 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@666b9476, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7084c9b9 [2022-07-22 14:25:02,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:25:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:25:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 14:25:02,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:25:02,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:25:02,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:25:02,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:25:02,061 INFO L85 PathProgramCache]: Analyzing trace with hash 658478814, now seen corresponding path program 1 times [2022-07-22 14:25:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:25:02,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969937341] [2022-07-22 14:25:02,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:25:02,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:25:02,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:25:02,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:25:02,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 14:25:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:25:02,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 14:25:02,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:25:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:25:02,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:25:02,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:25:02,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969937341] [2022-07-22 14:25:02,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969937341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:25:02,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:25:02,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:25:02,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825102836] [2022-07-22 14:25:02,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:25:02,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:25:02,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:25:02,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:25:02,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:25:02,222 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:25:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:25:02,243 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2022-07-22 14:25:02,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:25:02,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 14:25:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:25:02,252 INFO L225 Difference]: With dead ends: 72 [2022-07-22 14:25:02,252 INFO L226 Difference]: Without dead ends: 34 [2022-07-22 14:25:02,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-07-22 14:25:02,258 INFO L413 NwaCegarLoop]: 51 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, 51 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-07-22 14:25:02,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:25:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-22 14:25:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-22 14:25:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:25:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-07-22 14:25:02,295 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 13 [2022-07-22 14:25:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:25:02,296 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-07-22 14:25:02,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:25:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-07-22 14:25:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 14:25:02,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:25:02,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:25:02,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:25:02,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:25:02,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:25:02,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:25:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1562173395, now seen corresponding path program 1 times [2022-07-22 14:25:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:25:02,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966100688] [2022-07-22 14:25:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:25:02,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:25:02,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:25:02,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:25:02,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 14:25:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:25:02,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 14:25:02,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:25:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:25:02,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:25:02,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:25:02,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966100688] [2022-07-22 14:25:02,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966100688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:25:02,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:25:02,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:25:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008402173] [2022-07-22 14:25:02,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:25:02,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:25:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:25:02,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:25:02,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:25:02,851 INFO L87 Difference]: Start difference. First operand 34 states and 48 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-07-22 14:25:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:25:02,861 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-22 14:25:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:25:02,861 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-07-22 14:25:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:25:02,863 INFO L225 Difference]: With dead ends: 45 [2022-07-22 14:25:02,864 INFO L226 Difference]: Without dead ends: 26 [2022-07-22 14:25:02,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:25:02,866 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:25:02,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-07-22 14:25:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-22 14:25:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-22 14:25:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:25:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-22 14:25:02,877 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-07-22 14:25:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:25:02,878 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-22 14:25:02,878 INFO L496 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-07-22 14:25:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-22 14:25:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 14:25:02,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:25:02,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:25:02,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:25:03,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:25:03,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:25:03,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:25:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1129837443, now seen corresponding path program 1 times [2022-07-22 14:25:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:25:03,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119092310] [2022-07-22 14:25:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:25:03,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:25:03,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:25:03,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:25:03,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 14:25:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:25:03,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 14:25:03,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:25:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:25:03,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:25:03,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:25:03,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119092310] [2022-07-22 14:25:03,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119092310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:25:03,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:25:03,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:25:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883139681] [2022-07-22 14:25:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:25:03,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:25:03,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:25:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:25:03,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:25:03,364 INFO L87 Difference]: Start difference. First operand 26 states and 32 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-07-22 14:25:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:25:03,367 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-07-22 14:25:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:25:03,368 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-07-22 14:25:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:25:03,368 INFO L225 Difference]: With dead ends: 34 [2022-07-22 14:25:03,368 INFO L226 Difference]: Without dead ends: 16 [2022-07-22 14:25:03,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:25:03,370 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:25:03,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-07-22 14:25:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-22 14:25:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-22 14:25:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:25:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-07-22 14:25:03,373 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2022-07-22 14:25:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:25:03,374 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-07-22 14:25:03,374 INFO L496 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-07-22 14:25:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-07-22 14:25:03,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 14:25:03,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:25:03,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:25:03,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:25:03,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:25:03,587 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:25:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:25:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1582346339, now seen corresponding path program 1 times [2022-07-22 14:25:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:25:03,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684262156] [2022-07-22 14:25:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:25:03,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:25:03,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:25:03,589 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:25:03,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 14:25:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:25:03,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-22 14:25:03,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:25:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:25:04,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:25:04,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:25:04,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684262156] [2022-07-22 14:25:04,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684262156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:25:04,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:25:04,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 14:25:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954340641] [2022-07-22 14:25:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:25:04,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 14:25:04,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:25:04,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 14:25:04,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 14:25:04,054 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-07-22 14:25:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:25:04,241 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-22 14:25:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 14:25:04,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-07-22 14:25:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:25:04,242 INFO L225 Difference]: With dead ends: 16 [2022-07-22 14:25:04,242 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 14:25:04,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-22 14:25:04,243 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:25:04,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-07-22 14:25:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 14:25:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 14:25:04,244 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-07-22 14:25:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 14:25:04,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-07-22 14:25:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:25:04,245 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 14:25:04,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-07-22 14:25:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 14:25:04,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 14:25:04,252 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 14:25:04,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:25:04,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:25:04,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 14:25:04,545 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 69) no Hoare annotation was computed. [2022-07-22 14:25:04,545 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 60 69) no Hoare annotation was computed. [2022-07-22 14:25:04,545 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 85 90) no Hoare annotation was computed. [2022-07-22 14:25:04,545 INFO L895 garLoopResultBuilder]: At program point L85-2(lines 85 90) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (and (= .cse0 |ULTIMATE.start_isinf_double_~x#1|) (= |ULTIMATE.start_ceil_double_#res#1| .cse0) (= |ULTIMATE.start_ceil_double_~x#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-22 14:25:04,546 INFO L899 garLoopResultBuilder]: For program point L85-3(lines 85 90) no Hoare annotation was computed. [2022-07-22 14:25:04,546 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-07-22 14:25:04,546 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2022-07-22 14:25:04,546 INFO L895 garLoopResultBuilder]: At program point L94(lines 83 95) the Hoare annotation is: (exists ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_13|)) (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse0 .cse0))) (= (bvadd (_ bv1 32) (bvneg (bvlshr (let ((.cse1 (bvadd (_ bv2146435072 32) (bvneg (bvor (bvlshr (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_13|))) (bvor (bvneg .cse2) .cse2)) (_ bv31 32)) (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_13|))))))) (bvor (bvneg .cse1) .cse1)) (_ bv31 32)))) |ULTIMATE.start_isinf_double_#res#1|))) [2022-07-22 14:25:04,546 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 14:25:04,546 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 68) no Hoare annotation was computed. [2022-07-22 14:25:04,546 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 14:25:04,546 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 72) no Hoare annotation was computed. [2022-07-22 14:25:04,546 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 49) no Hoare annotation was computed. [2022-07-22 14:25:04,547 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2022-07-22 14:25:04,547 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_ceil_double_~x#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-22 14:25:04,547 INFO L899 garLoopResultBuilder]: For program point L21-3(lines 21 26) no Hoare annotation was computed. [2022-07-22 14:25:04,547 INFO L902 garLoopResultBuilder]: At program point L112(lines 97 113) the Hoare annotation is: true [2022-07-22 14:25:04,547 INFO L895 garLoopResultBuilder]: At program point L79(lines 18 80) the Hoare annotation is: (and (= |ULTIMATE.start_ceil_double_#res#1| (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse0 .cse0))) (= |ULTIMATE.start_ceil_double_~x#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-22 14:25:04,547 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 38) no Hoare annotation was computed. [2022-07-22 14:25:04,547 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 37) no Hoare annotation was computed. [2022-07-22 14:25:04,547 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 78) no Hoare annotation was computed. [2022-07-22 14:25:04,547 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 18 80) no Hoare annotation was computed. [2022-07-22 14:25:04,547 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 78) no Hoare annotation was computed. [2022-07-22 14:25:04,547 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 66) no Hoare annotation was computed. [2022-07-22 14:25:04,548 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 14:25:04,548 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 66) no Hoare annotation was computed. [2022-07-22 14:25:04,548 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 58) no Hoare annotation was computed. [2022-07-22 14:25:04,548 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2022-07-22 14:25:04,548 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 42) no Hoare annotation was computed. [2022-07-22 14:25:04,548 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 14:25:04,548 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 72) no Hoare annotation was computed. [2022-07-22 14:25:04,548 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 111) no Hoare annotation was computed. [2022-07-22 14:25:04,548 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 37) no Hoare annotation was computed. [2022-07-22 14:25:04,548 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 71) no Hoare annotation was computed. [2022-07-22 14:25:04,549 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 54) no Hoare annotation was computed. [2022-07-22 14:25:04,549 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-07-22 14:25:04,549 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2022-07-22 14:25:04,554 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-07-22 14:25:04,557 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 14:25:04,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,567 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,567 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,571 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,571 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,571 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,571 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,579 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:25:04,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:25:04,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:25:04,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:25:04,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 02:25:04 BoogieIcfgContainer [2022-07-22 14:25:04,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 14:25:04,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 14:25:04,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 14:25:04,587 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 14:25:04,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:25:01" (3/4) ... [2022-07-22 14:25:04,594 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 14:25:04,605 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-22 14:25:04,605 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-22 14:25:04,606 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 14:25:04,606 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 14:25:04,629 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-22 14:25:04,630 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-22 14:25:04,631 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == x && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-22 14:25:04,632 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_skolemized_q#valueAsBitvector_13 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_13[63:63], v_skolemized_q#valueAsBitvector_13[62:52], v_skolemized_q#valueAsBitvector_13[51:0]) == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) && ~bvadd64(1bv32, ~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), 31bv32))) == \result) [2022-07-22 14:25:04,651 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 14:25:04,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 14:25:04,652 INFO L158 Benchmark]: Toolchain (without parser) took 4689.29ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 39.9MB in the beginning and 35.5MB in the end (delta: 4.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2022-07-22 14:25:04,652 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:25:04,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.70ms. Allocated memory is still 60.8MB. Free memory was 39.7MB in the beginning and 43.5MB in the end (delta: -3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 14:25:04,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.50ms. Allocated memory is still 60.8MB. Free memory was 43.5MB in the beginning and 41.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:25:04,653 INFO L158 Benchmark]: Boogie Preprocessor took 67.67ms. Allocated memory is still 60.8MB. Free memory was 41.7MB in the beginning and 40.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:25:04,653 INFO L158 Benchmark]: RCFGBuilder took 1590.76ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 39.9MB in the beginning and 53.9MB in the end (delta: -14.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-07-22 14:25:04,655 INFO L158 Benchmark]: TraceAbstraction took 2612.79ms. Allocated memory is still 73.4MB. Free memory was 53.4MB in the beginning and 38.8MB in the end (delta: 14.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-07-22 14:25:04,655 INFO L158 Benchmark]: Witness Printer took 64.40ms. Allocated memory is still 73.4MB. Free memory was 38.8MB in the beginning and 35.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 14:25:04,657 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.70ms. Allocated memory is still 60.8MB. Free memory was 39.7MB in the beginning and 43.5MB in the end (delta: -3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.50ms. Allocated memory is still 60.8MB. Free memory was 43.5MB in the beginning and 41.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.67ms. Allocated memory is still 60.8MB. Free memory was 41.7MB in the beginning and 40.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1590.76ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 39.9MB in the beginning and 53.9MB in the end (delta: -14.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2612.79ms. Allocated memory is still 73.4MB. Free memory was 53.4MB in the beginning and 38.8MB in the end (delta: 14.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Witness Printer took 64.40ms. Allocated memory is still 73.4MB. Free memory was 38.8MB in the beginning and 35.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 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] - 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] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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: 109]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 218 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 98 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 21, 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, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 151 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 13 QuantifiedInterpolants, 509 SizeOfPredicates, 26 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 40 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: 83]: Loop Invariant [2022-07-22 14:25:04,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-22 14:25:04,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] Derived loop invariant: (\exists v_skolemized_q#valueAsBitvector_13 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_13[63:63], v_skolemized_q#valueAsBitvector_13[62:52], v_skolemized_q#valueAsBitvector_13[51:0]) == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) && ~bvadd64(1bv32, ~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), 31bv32))) == \result) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 85]: Loop Invariant [2022-07-22 14:25:04,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == x && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 18]: Loop Invariant [2022-07-22 14:25:04,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 21]: Loop Invariant [2022-07-22 14:25:04,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:25:04,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:25:04,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:25:04,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:25:04,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:25:04,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-07-22 14:25:04,725 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