./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1052d.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_1052d.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 5e916ae9c48effac9b6c4a1d1191ee8fa3cb5babfe7e8bb0aead8328ceda8c4a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:12:12,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:12:12,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:12:12,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:12:12,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:12:12,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:12:12,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:12:12,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:12:12,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:12:12,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:12:12,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:12:12,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:12:12,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:12:12,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:12:12,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:12:12,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:12:12,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:12:12,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:12:12,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:12:12,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:12:12,703 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:12:12,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:12:12,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:12:12,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:12:12,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:12:12,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:12:12,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:12:12,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:12:12,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:12:12,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:12:12,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:12:12,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:12:12,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:12:12,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:12:12,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:12:12,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:12:12,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:12:12,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:12:12,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:12:12,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:12:12,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:12:12,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:12:12,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:12:12,745 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:12:12,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:12:12,746 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:12:12,746 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:12:12,747 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:12:12,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:12:12,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:12:12,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:12:12,748 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:12:12,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:12:12,749 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:12:12,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:12:12,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:12:12,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:12:12,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:12:12,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:12:12,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:12:12,750 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:12:12,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:12:12,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:12:12,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:12:12,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:12:12,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:12:12,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:12:12,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:12:12,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:12:12,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:12:12,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:12:12,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:12:12,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:12:12,760 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:12:12,760 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:12:12,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:12:12,760 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 -> 5e916ae9c48effac9b6c4a1d1191ee8fa3cb5babfe7e8bb0aead8328ceda8c4a [2022-07-19 14:12:12,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:12:12,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:12:12,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:12:12,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:12:12,968 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:12:12,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052d.c [2022-07-19 14:12:13,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d912ee0f/6a3ef4c2192742c3a462c6a6290283ac/FLAGb349b6723 [2022-07-19 14:12:13,444 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:12:13,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052d.c [2022-07-19 14:12:13,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d912ee0f/6a3ef4c2192742c3a462c6a6290283ac/FLAGb349b6723 [2022-07-19 14:12:13,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d912ee0f/6a3ef4c2192742c3a462c6a6290283ac [2022-07-19 14:12:13,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:12:13,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:12:13,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:12:13,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:12:13,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:12:13,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47210d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13, skipping insertion in model container [2022-07-19 14:12:13,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:12:13,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:12:14,058 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_1052d.c[2259,2272] [2022-07-19 14:12:14,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:12:14,066 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:12:14,086 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_1052d.c[2259,2272] [2022-07-19 14:12:14,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:12:14,096 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:12:14,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14 WrapperNode [2022-07-19 14:12:14,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:12:14,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:12:14,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:12:14,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:12:14,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (1/1) ... [2022-07-19 14:12:14,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (1/1) ... [2022-07-19 14:12:14,133 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-07-19 14:12:14,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:12:14,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:12:14,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:12:14,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:12:14,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (1/1) ... [2022-07-19 14:12:14,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (1/1) ... [2022-07-19 14:12:14,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (1/1) ... [2022-07-19 14:12:14,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (1/1) ... [2022-07-19 14:12:14,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (1/1) ... [2022-07-19 14:12:14,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (1/1) ... [2022-07-19 14:12:14,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (1/1) ... [2022-07-19 14:12:14,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:12:14,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:12:14,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:12:14,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:12:14,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (1/1) ... [2022-07-19 14:12:14,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:12:14,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:12:14,209 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-19 14:12:14,214 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-19 14:12:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:12:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:12:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:12:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-19 14:12:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:12:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-19 14:12:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:12:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:12:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:12:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:12:14,299 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:12:14,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:12:14,570 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:12:14,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:12:14,587 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-19 14:12:14,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:14 BoogieIcfgContainer [2022-07-19 14:12:14,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:12:14,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:12:14,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:12:14,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:12:14,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:12:13" (1/3) ... [2022-07-19 14:12:14,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebeeba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:12:14, skipping insertion in model container [2022-07-19 14:12:14,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:14" (2/3) ... [2022-07-19 14:12:14,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebeeba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:12:14, skipping insertion in model container [2022-07-19 14:12:14,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:14" (3/3) ... [2022-07-19 14:12:14,596 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052d.c [2022-07-19 14:12:14,606 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:12:14,619 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:12:14,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:12:14,694 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@71f8f4c7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1bc776d7 [2022-07-19 14:12:14,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:12:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 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-19 14:12:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:12:14,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:14,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:14,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:14,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2022-07-19 14:12:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:12:14,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510247314] [2022-07-19 14:12:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:12:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:14,869 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-19 14:12:14,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:12:14,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510247314] [2022-07-19 14:12:14,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510247314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:14,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:14,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:12:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263925802] [2022-07-19 14:12:14,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:14,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:12:14,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:12:14,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:12:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:12:14,908 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:14,927 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2022-07-19 14:12:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:12:14,929 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 14:12:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:14,936 INFO L225 Difference]: With dead ends: 74 [2022-07-19 14:12:14,936 INFO L226 Difference]: Without dead ends: 35 [2022-07-19 14:12:14,938 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-19 14:12:14,941 INFO L413 NwaCegarLoop]: 53 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, 53 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-19 14:12:14,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:12:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-19 14:12:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-19 14:12:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 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-19 14:12:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-07-19 14:12:14,965 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2022-07-19 14:12:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:14,966 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-07-19 14:12:14,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-07-19 14:12:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:12:14,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:14,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:14,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:12:14,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2022-07-19 14:12:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:12:14,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921190490] [2022-07-19 14:12:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:12:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:12:15,054 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 14:12:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:12:15,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 14:12:15,149 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 14:12:15,150 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:12:15,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:12:15,153 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-19 14:12:15,155 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:12:15,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:12:15 BoogieIcfgContainer [2022-07-19 14:12:15,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:12:15,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:12:15,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:12:15,188 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:12:15,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:14" (3/4) ... [2022-07-19 14:12:15,191 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 14:12:15,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:12:15,192 INFO L158 Benchmark]: Toolchain (without parser) took 1311.29ms. Allocated memory is still 155.2MB. Free memory was 126.9MB in the beginning and 126.2MB in the end (delta: 727.5kB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2022-07-19 14:12:15,193 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 92.3MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:12:15,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.80ms. Allocated memory is still 155.2MB. Free memory was 126.6MB in the beginning and 129.9MB in the end (delta: -3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 14:12:15,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.26ms. Allocated memory is still 155.2MB. Free memory was 129.9MB in the beginning and 127.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:12:15,197 INFO L158 Benchmark]: Boogie Preprocessor took 24.39ms. Allocated memory is still 155.2MB. Free memory was 127.3MB in the beginning and 125.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:12:15,198 INFO L158 Benchmark]: RCFGBuilder took 430.10ms. Allocated memory is still 155.2MB. Free memory was 125.2MB in the beginning and 107.3MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-19 14:12:15,198 INFO L158 Benchmark]: TraceAbstraction took 595.07ms. Allocated memory is still 155.2MB. Free memory was 106.8MB in the beginning and 126.2MB in the end (delta: -19.4MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-07-19 14:12:15,198 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 155.2MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:12:15,202 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.38ms. Allocated memory is still 92.3MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.80ms. Allocated memory is still 155.2MB. Free memory was 126.6MB in the beginning and 129.9MB in the end (delta: -3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.26ms. Allocated memory is still 155.2MB. Free memory was 129.9MB in the beginning and 127.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.39ms. Allocated memory is still 155.2MB. Free memory was 127.3MB in the beginning and 125.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.10ms. Allocated memory is still 155.2MB. Free memory was 125.2MB in the beginning and 107.3MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 595.07ms. Allocated memory is still 155.2MB. Free memory was 106.8MB in the beginning and 126.2MB in the end (delta: -19.4MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 155.2MB. Free memory is still 126.2MB. 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: 105]: 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 39, overapproximation of bitwiseOr at line 40, overapproximation of bitwiseAnd at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L16] static const double huge_floor = 1.0e300; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L100] double x = 0.0; [L101] CALL, EXPR floor_double(x) [L19] __int32_t i0, i1, j0; [L20] __uint32_t i, j; VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [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)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=6291457, i1=0, j0=0, x=0] [L28] COND TRUE j0 < 20 VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=6291457, i1=0, j0=0, x=0] [L29] COND FALSE !(j0 < 0) [L39] i = (0x000fffff) >> j0 VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=4294967296, i0=6291457, i1=0, j0=0, x=0] [L40] COND TRUE ((i0 & i) | i1) == 0 [L41] return x; VAL [\old(x)=0, \result=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=4294967296, i0=6291457, i1=0, j0=0, x=0] [L101] RET, EXPR floor_double(x) [L101] double res = floor_double(x); [L104] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=0, res == 0.0 && __signbit_double(res) == 0=0, x=0] [L104] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L105] reach_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=0, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, 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, 53 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, 53 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=38occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 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-19 14:12:15,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1052d.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 5e916ae9c48effac9b6c4a1d1191ee8fa3cb5babfe7e8bb0aead8328ceda8c4a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:12:16,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:12:16,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:12:17,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:12:17,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:12:17,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:12:17,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:12:17,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:12:17,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:12:17,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:12:17,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:12:17,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:12:17,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:12:17,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:12:17,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:12:17,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:12:17,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:12:17,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:12:17,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:12:17,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:12:17,054 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:12:17,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:12:17,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:12:17,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:12:17,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:12:17,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:12:17,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:12:17,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:12:17,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:12:17,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:12:17,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:12:17,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:12:17,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:12:17,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:12:17,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:12:17,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:12:17,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:12:17,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:12:17,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:12:17,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:12:17,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:12:17,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:12:17,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:12:17,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:12:17,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:12:17,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:12:17,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:12:17,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:12:17,103 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:12:17,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:12:17,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:12:17,104 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:12:17,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:12:17,105 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:12:17,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:12:17,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:12:17,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:12:17,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:12:17,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:12:17,106 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:12:17,106 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:12:17,106 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:12:17,107 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:12:17,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:12:17,107 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:12:17,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:12:17,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:12:17,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:12:17,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:12:17,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:12:17,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:12:17,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:12:17,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:12:17,108 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:12:17,109 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:12:17,109 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:12:17,109 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:12:17,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:12:17,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:12:17,109 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 -> 5e916ae9c48effac9b6c4a1d1191ee8fa3cb5babfe7e8bb0aead8328ceda8c4a [2022-07-19 14:12:17,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:12:17,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:12:17,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:12:17,403 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:12:17,403 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:12:17,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052d.c [2022-07-19 14:12:17,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7eae843b/da6b44f3721c4b6aaaa3dd5f9e0b2114/FLAG5847cf76b [2022-07-19 14:12:17,779 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:12:17,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052d.c [2022-07-19 14:12:17,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7eae843b/da6b44f3721c4b6aaaa3dd5f9e0b2114/FLAG5847cf76b [2022-07-19 14:12:18,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7eae843b/da6b44f3721c4b6aaaa3dd5f9e0b2114 [2022-07-19 14:12:18,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:12:18,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:12:18,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:12:18,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:12:18,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:12:18,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786e5ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18, skipping insertion in model container [2022-07-19 14:12:18,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:12:18,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:12:18,347 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_1052d.c[2259,2272] [2022-07-19 14:12:18,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:12:18,396 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:12:18,427 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_1052d.c[2259,2272] [2022-07-19 14:12:18,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:12:18,444 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:12:18,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18 WrapperNode [2022-07-19 14:12:18,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:12:18,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:12:18,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:12:18,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:12:18,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,510 INFO L137 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-07-19 14:12:18,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:12:18,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:12:18,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:12:18,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:12:18,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:12:18,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:12:18,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:12:18,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:12:18,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (1/1) ... [2022-07-19 14:12:18,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:12:18,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:12:18,620 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-19 14:12:18,626 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-19 14:12:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:12:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-19 14:12:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-19 14:12:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:12:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:12:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:12:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:12:18,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:12:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:12:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:12:18,707 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:12:18,709 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:12:19,685 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:12:19,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:12:19,690 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-19 14:12:19,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:19 BoogieIcfgContainer [2022-07-19 14:12:19,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:12:19,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:12:19,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:12:19,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:12:19,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:12:18" (1/3) ... [2022-07-19 14:12:19,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32552241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:12:19, skipping insertion in model container [2022-07-19 14:12:19,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:18" (2/3) ... [2022-07-19 14:12:19,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32552241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:12:19, skipping insertion in model container [2022-07-19 14:12:19,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:19" (3/3) ... [2022-07-19 14:12:19,697 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052d.c [2022-07-19 14:12:19,707 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:12:19,708 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:12:19,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:12:19,750 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@22b66e8b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fe57058 [2022-07-19 14:12:19,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:12:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 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-19 14:12:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:12:19,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:19,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:19,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:19,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2022-07-19 14:12:19,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:19,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469280138] [2022-07-19 14:12:19,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:19,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:19,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:19,788 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-19 14:12:19,789 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-19 14:12:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:19,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:12:19,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:19,887 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-19 14:12:19,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:19,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:19,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469280138] [2022-07-19 14:12:19,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469280138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:19,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:19,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:12:19,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619815470] [2022-07-19 14:12:19,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:19,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:12:19,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:19,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:12:19,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:12:19,921 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:19,937 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2022-07-19 14:12:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:12:19,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 14:12:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:19,946 INFO L225 Difference]: With dead ends: 74 [2022-07-19 14:12:19,946 INFO L226 Difference]: Without dead ends: 35 [2022-07-19 14:12:19,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-19 14:12:19,952 INFO L413 NwaCegarLoop]: 53 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, 53 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-19 14:12:19,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:12:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-19 14:12:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-19 14:12:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 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-19 14:12:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-07-19 14:12:19,980 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2022-07-19 14:12:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:19,981 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-07-19 14:12:19,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-07-19 14:12:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:12:19,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:19,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:19,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 14:12:20,190 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-19 14:12:20,190 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2022-07-19 14:12:20,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:20,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437820894] [2022-07-19 14:12:20,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:20,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:20,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:20,193 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-19 14:12:20,194 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-19 14:12:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:20,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 14:12:20,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:20,405 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-19 14:12:20,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:20,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:20,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437820894] [2022-07-19 14:12:20,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437820894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:20,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:20,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:12:20,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681915444] [2022-07-19 14:12:20,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:20,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:12:20,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:20,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:12:20,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:12:20,407 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:21,051 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-07-19 14:12:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:12:21,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-19 14:12:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:21,055 INFO L225 Difference]: With dead ends: 47 [2022-07-19 14:12:21,055 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:12:21,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:12:21,057 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 14:12:21,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 22 Unchecked, 0.6s Time] [2022-07-19 14:12:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:12:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-19 14:12:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 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-19 14:12:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-07-19 14:12:21,062 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 12 [2022-07-19 14:12:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:21,062 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-19 14:12:21,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-07-19 14:12:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:12:21,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:21,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:21,076 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-19 14:12:21,278 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-19 14:12:21,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:21,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1803079892, now seen corresponding path program 1 times [2022-07-19 14:12:21,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:21,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363986452] [2022-07-19 14:12:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:21,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:21,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:21,302 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-19 14:12:21,303 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-19 14:12:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:21,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 14:12:21,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:21,424 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-19 14:12:21,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:21,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363986452] [2022-07-19 14:12:21,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363986452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:21,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:21,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:12:21,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959970466] [2022-07-19 14:12:21,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:21,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:12:21,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:21,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:12:21,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:12:21,427 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:21,837 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-07-19 14:12:21,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:12:21,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-19 14:12:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:21,846 INFO L225 Difference]: With dead ends: 43 [2022-07-19 14:12:21,846 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 14:12:21,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:12:21,848 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:12:21,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 11 Unchecked, 0.4s Time] [2022-07-19 14:12:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 14:12:21,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 14:12:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-19 14:12:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-19 14:12:21,850 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2022-07-19 14:12:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:21,850 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-19 14:12:21,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-19 14:12:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 14:12:21,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:21,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:21,877 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-19 14:12:22,051 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-19 14:12:22,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash -649381144, now seen corresponding path program 1 times [2022-07-19 14:12:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:22,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033847886] [2022-07-19 14:12:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:22,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:22,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:22,055 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-19 14:12:22,069 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-19 14:12:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:22,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:12:22,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:22,290 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-19 14:12:22,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:22,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:22,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033847886] [2022-07-19 14:12:22,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033847886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:22,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:22,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:12:22,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131080010] [2022-07-19 14:12:22,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:22,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:12:22,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:12:22,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:12:22,292 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-19 14:12:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:22,342 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-19 14:12:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:12:22,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-19 14:12:22,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:22,344 INFO L225 Difference]: With dead ends: 34 [2022-07-19 14:12:22,344 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 14:12:22,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:12:22,345 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:12:22,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:12:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 14:12:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 14:12:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-19 14:12:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-19 14:12:22,347 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2022-07-19 14:12:22,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:22,347 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-19 14:12:22,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-19 14:12:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-19 14:12:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 14:12:22,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:22,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:22,368 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-19 14:12:22,548 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-19 14:12:22,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1381924140, now seen corresponding path program 1 times [2022-07-19 14:12:22,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:22,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921536871] [2022-07-19 14:12:22,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:22,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:22,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:22,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:12:22,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 14:12:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:22,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 14:12:22,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:22,739 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-19 14:12:22,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:22,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:22,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921536871] [2022-07-19 14:12:22,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921536871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:22,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:22,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:12:22,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140462702] [2022-07-19 14:12:22,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:22,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:12:22,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:22,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:12:22,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:12:22,740 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:23,013 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-07-19 14:12:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:12:23,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 14:12:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:23,014 INFO L225 Difference]: With dead ends: 34 [2022-07-19 14:12:23,014 INFO L226 Difference]: Without dead ends: 21 [2022-07-19 14:12:23,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:12:23,015 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:12:23,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 25 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:12:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-19 14:12:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-19 14:12:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.0) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2022-07-19 14:12:23,017 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 16 [2022-07-19 14:12:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:23,018 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2022-07-19 14:12:23,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-07-19 14:12:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:12:23,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:23,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:23,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:12:23,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:12:23,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2014843095, now seen corresponding path program 1 times [2022-07-19 14:12:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:23,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796807065] [2022-07-19 14:12:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:23,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:23,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:23,224 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:12:23,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 14:12:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:23,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 14:12:23,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:23,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2022-07-19 14:12:23,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:12:23,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 25 [2022-07-19 14:12:23,546 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-19 14:12:23,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:23,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:23,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796807065] [2022-07-19 14:12:23,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796807065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:23,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:23,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 14:12:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231555787] [2022-07-19 14:12:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:23,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:12:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:12:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:12:23,548 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:23,615 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-07-19 14:12:23,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:12:23,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-19 14:12:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:23,616 INFO L225 Difference]: With dead ends: 21 [2022-07-19 14:12:23,616 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 14:12:23,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-19 14:12:23,617 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:12:23,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-07-19 14:12:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 14:12:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 14:12:23,617 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-19 14:12:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 14:12:23,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-07-19 14:12:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:23,618 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 14:12:23,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 14:12:23,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 14:12:23,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:12:23,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:12:23,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:12:23,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 14:12:23,995 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 67) no Hoare annotation was computed. [2022-07-19 14:12:23,995 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 14:12:23,995 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 14:12:23,995 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 71) no Hoare annotation was computed. [2022-07-19 14:12:23,995 INFO L895 garLoopResultBuilder]: At program point L78(lines 18 79) the Hoare annotation is: (let ((.cse0 (let ((.cse4 (concat (_ bv0 32) (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (and (= .cse0 |ULTIMATE.start_floor_double_#res#1|) (= |ULTIMATE.start_floor_double_~i1~0#1| |ULTIMATE.start_floor_double_~i0~0#1|) (= .cse0 |ULTIMATE.start_floor_double_~x#1|) (= |ULTIMATE.start_floor_double_~i1~0#1| (_ bv0 32)) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (exists ((|v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9| (_ BitVec 32))) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9|))) (let ((.cse2 (select .cse3 (_ bv4 32)))) (and (= (let ((.cse1 (concat .cse2 (select .cse3 (_ bv0 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_floor_double_#res#1|) (= .cse2 (_ bv0 32)))))) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 48) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= (let ((.cse0 (concat (_ bv0 32) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) |ULTIMATE.start_floor_double_~x#1|) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L21-3(lines 21 26) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L104-2(lines 104 107) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 37) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 77) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 18 79) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L72-2(lines 72 77) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 36) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L64-2(lines 64 65) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 57) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 14:12:23,996 INFO L895 garLoopResultBuilder]: At program point L90(lines 81 91) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (concat (_ bv0 32) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (= .cse0 |ULTIMATE.start_floor_double_#res#1|) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_floor_double_~i1~0#1| |ULTIMATE.start_floor_double_~i0~0#1|) (= .cse0 |ULTIMATE.start_floor_double_~x#1|) (= |ULTIMATE.start_floor_double_~i1~0#1| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start___signbit_double_#res#1|) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 71) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 36) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 53) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 47) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 68) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 59 68) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 88) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L895 garLoopResultBuilder]: At program point L84-2(lines 84 88) the Hoare annotation is: (let ((.cse0 (let ((.cse4 (concat (_ bv0 32) (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (and (= .cse0 |ULTIMATE.start_floor_double_#res#1|) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_floor_double_~i1~0#1| |ULTIMATE.start_floor_double_~i0~0#1|) (= .cse0 |ULTIMATE.start_floor_double_~x#1|) (= |ULTIMATE.start_floor_double_~i1~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9| (_ BitVec 32))) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9|))) (let ((.cse1 (select .cse3 (_ bv4 32)))) (and (= .cse1 (_ bv0 32)) (= (let ((.cse2 (concat .cse1 (select .cse3 (_ bv0 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start___signbit_double_~x#1|))))) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L902 garLoopResultBuilder]: At program point L109(lines 93 110) the Hoare annotation is: true [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 44) no Hoare annotation was computed. [2022-07-19 14:12:23,997 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-07-19 14:12:23,999 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-19 14:12:24,001 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:12:24,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,016 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,016 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:12:24 BoogieIcfgContainer [2022-07-19 14:12:24,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:12:24,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:12:24,034 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:12:24,035 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:12:24,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:19" (3/4) ... [2022-07-19 14:12:24,037 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 14:12:24,045 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-19 14:12:24,046 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-19 14:12:24,046 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 14:12:24,046 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 14:12:24,063 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == \result && i1 == i0) && ~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == x) && i1 == 0bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && (\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9 : bv32 :: ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[51:0]) == \result && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] == 0bv32)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-19 14:12:24,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && i1 == i0) && ~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == x) && i1 == 0bv32) && (\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9 : bv32 :: unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] == 0bv32 && ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-19 14:12:24,066 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && i1 == i0) && ~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == x) && i1 == 0bv32) && 0bv32 == \result) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-19 14:12:24,080 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:12:24,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:12:24,081 INFO L158 Benchmark]: Toolchain (without parser) took 5864.41ms. Allocated memory was 52.4MB in the beginning and 71.3MB in the end (delta: 18.9MB). Free memory was 30.2MB in the beginning and 38.1MB in the end (delta: -8.0MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,081 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory was 33.8MB in the beginning and 33.7MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:12:24,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.80ms. Allocated memory was 52.4MB in the beginning and 71.3MB in the end (delta: 18.9MB). Free memory was 29.9MB in the beginning and 53.8MB in the end (delta: -23.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.07ms. Allocated memory is still 71.3MB. Free memory was 53.6MB in the beginning and 51.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,082 INFO L158 Benchmark]: Boogie Preprocessor took 66.43ms. Allocated memory is still 71.3MB. Free memory was 51.7MB in the beginning and 50.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:12:24,082 INFO L158 Benchmark]: RCFGBuilder took 1113.09ms. Allocated memory is still 71.3MB. Free memory was 50.0MB in the beginning and 52.7MB in the end (delta: -2.7MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,083 INFO L158 Benchmark]: TraceAbstraction took 4340.97ms. Allocated memory is still 71.3MB. Free memory was 52.1MB in the beginning and 41.9MB in the end (delta: 10.2MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,083 INFO L158 Benchmark]: Witness Printer took 46.21ms. Allocated memory is still 71.3MB. Free memory was 41.9MB in the beginning and 38.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,085 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.17ms. Allocated memory is still 52.4MB. Free memory was 33.8MB in the beginning and 33.7MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.80ms. Allocated memory was 52.4MB in the beginning and 71.3MB in the end (delta: 18.9MB). Free memory was 29.9MB in the beginning and 53.8MB in the end (delta: -23.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.07ms. Allocated memory is still 71.3MB. Free memory was 53.6MB in the beginning and 51.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.43ms. Allocated memory is still 71.3MB. Free memory was 51.7MB in the beginning and 50.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1113.09ms. Allocated memory is still 71.3MB. Free memory was 50.0MB in the beginning and 52.7MB in the end (delta: -2.7MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4340.97ms. Allocated memory is still 71.3MB. Free memory was 52.1MB in the beginning and 41.9MB in the end (delta: 10.2MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 46.21ms. Allocated memory is still 71.3MB. Free memory was 41.9MB in the beginning and 38.1MB in the end (delta: 3.7MB). 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_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,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[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,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[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,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 * 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: 105]: 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 381 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 59 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 157 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 32, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 261 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 14 QuantifiedInterpolants, 613 SizeOfPredicates, 34 NumberOfNonLiveVariables, 317 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 84]: Loop Invariant [2022-07-19 14:12:24,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && i1 == i0) && ~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == x) && i1 == 0bv32) && (\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9 : bv32 :: unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] == 0bv32 && ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 81]: Loop Invariant [2022-07-19 14:12:24,106 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && i1 == i0) && ~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == x) && i1 == 0bv32) && 0bv32 == \result) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 18]: Loop Invariant [2022-07-19 14:12:24,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-19 14:12:24,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == \result && i1 == i0) && ~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == x) && i1 == 0bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && (\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9 : bv32 :: ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][0bv32])[51:0]) == \result && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_9][4bv32] == 0bv32)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 21]: Loop Invariant [2022-07-19 14:12:24,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp~LONGDOUBLE((0bv32 ++ 0bv32)[63:63], (0bv32 ++ 0bv32)[62:52], (0bv32 ++ 0bv32)[51:0]) == x && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-07-19 14:12:24,138 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